MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Evangelos Kranakis" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 93 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • Symmetry and Computational Complexity of Boolean Functions: Problems and Results  
  • by Evangelos Kranakis — 2002
  • …f(x ) = f(x))} n is a permutation group! A Thought: Can Aut(f) "measure" the symmetry of f? The more symmetric the easier! So, we have the following: Theorem 2 If Aut(f) = n then f can be computed by a fan-in 2 boolean circuit of size O(n). What would be more natural than the following co…
  • Add To MetaCart
  • Symmetry and Computability in Anonymous Networks: A Brief Survey  
  • by Evangelos Kranakis — 1996 — Proc. 3rd Int. Conf. on Structural Information and Communication Complexity (SIROCCO'96), Carleton
  • …. Processors in anonymous networks are as identical to each other as possible and possess "little" knowledge about the network. Anonymous networks are very useful in theoretical studies for testing "true distributivity". In this paper we give a brief survey of results illuminating how symmetry influ…
  • Cited by 10 (4 self) – Add To MetaCart
  • Almost Optimal On-line Search in Unknown Streets  
  • by Evangelos Kranakis, Anthony Spatharis — 1997 — In Proc. 9th Canad. Conf. Comput. Geom
  • …We consider the on-line navigation problem of a tactile robot searching for a target point g from a starting vertex s in an initially unknown street, which is a simple planar polygon (P, s, g) characterized by the property that the two oriented chains from s to g are mutually weakly visible. We …
  • Cited by 4 (0 self) – Add To MetaCart
  • Lower Bounds for Compact Routing (Extended Abstract)  
  • by Evangelos Kranakis, Danny Krizanc — 1995 — In 17th International Symposium on Theoretical Aspects of Computer Science
  • …In this paper we present lower bounds for compact routing schemes. We give (1) networks on n vertices which for any interval routing scheme,\Omega\Gamma n) routers of the network require\Omega\Gamma n) intervals on some out-going link and (2) for each d 3, networks of maximal degree d which for …
  • Cited by 1 (0 self) – Add To MetaCart
  • Implicit Routing And Shortest Path Information (Extended Abstract)  
  • by E. Kranakis, D. Krizanc, Evangelos Kranakis, Danny Krizanc, J. Urrutia — 1995 — Proc. 2nd Colloquium on Structural Information & Communication Complexity (SIROCCO’95
  • …) Evangelos Kranakis y (kranakis@scs.carleton.ca) Danny Krizanc y (krizanc@scs.carleton.ca) Jorge Urrutia zy (jorge@csi.uottawa.ca) Abstract We study the problem of constructing graphs from shortest path information (complete or partial). Consider graphs with labeled vertices and edges. Given …
  • Cited by 1 (0 self) – Add To MetaCart
  • Camera Placement in Integer Lattices  
  • by Evangelos Kranakis, Evangelos Kranakis, Michel Pocchiola, Michel Pocchiola — 1992 — Centrum voor Wiskunde en Informatica, Department of Algorithmics and Architecture
  • …The camera placement problem concerns the placement of a fixed number of point-cameras on the integer lattice of d-tuples of integers in order to maximize their visibility. We give a caracterization of optimal configurations of size s less than 5 d and use it to compute in time O(s log s) an optim…
  • Cited by 1 (1 self) – Add To MetaCart
  • A Brief Survey of Art Gallery Problems in Integer Lattice Systems  
  • by Evangelos Kranakis, Evangelos Kranakis, Michel Pocchiola, Michel Pocchiola — 1991 — CWI Quaterly
  • …The camera placement problem concerns the placement of a fixed number of point-cameras on the integer lattice of d-tuples of integers in order to maximize their visibility. We survey some of the combinatorial optimization and algorithmic techniques which have been developed in order to study this an…
  • Cited by 1 (1 self) – Add To MetaCart
  • Location Oblivious Distributed Unit Disk Graph Coloring  
  • by Paz Carmi, Evangelos Kranakis — 2006
  • …We present the first location oblivious distributed unit disk graph coloring algorithm having a provable performance ratio of three (i.e. the number of colors used by the algorithm is at most three times the chromatic number of the graph). This is an improvement over the standard sequential coloring…
  • Cited by 1 (0 self) – Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB