The following pages link to Evangelos Kranakis (Q215100):
Displaying 50 items.
- Asymptotically optimal scheduling of random malleable demands in smart grid (Q4634529) (← links)
- Search on a Line by Byzantine Robots (Q4636509) (← links)
- Optimal shooting: Characterizations and applications (Q4645180) (← links)
- Applied Cryptography and Network Security (Q4680976) (← links)
- (Q4718423) (← links)
- (Q4733379) (← links)
- (Q4734764) (← links)
- (Q4817649) (← links)
- (Q4817650) (← links)
- Tree exploration with little memory (Q4818671) (← links)
- (Q4828987) (← links)
- On Multi-Label Linear Interval Routing Schemes (Q4886687) (← links)
- Position Discovery for a System of Bouncing Robots (Q4909422) (← links)
- Complexity of Barrier Coverage with Relocatable Sensors in the Plane (Q4924647) (← links)
- (Q4938771) (← links)
- Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks (Q4943847) (← links)
- Power consumption in packet radio networks (Q5048938) (← links)
- Rendezvous on a Line by Location-Aware Robots Despite the Presence of Byzantine Faults (Q5056052) (← links)
- Querying with Uncertainty (Q5056054) (← links)
- Searching for a Non-adversarial, Uncooperative Agent on a Cycle (Q5056057) (← links)
- Optimal rendezvous on a line by location-aware robots in the presence of spies* (Q5057736) (← links)
- Linear rendezvous with asymmetric clocks (Q5091103) (← links)
- Energy Consumption of Group Search on a Line (Q5092340) (← links)
- Patrolling a Path Connecting a Set of Points with Unbalanced Frequencies of Visits (Q5127186) (← links)
- Exploring Graphs with Time Constraints by Unreliable Collections of Mobile Robots (Q5127187) (← links)
- Distributed computing on oriented anonymous hypercubes with faulty components (Q5138360) (← links)
- Symmetry Breaking in the Plane (Q5145172) (← links)
- Distributed algorithms for barrier coverage using relocatable sensors (Q5176117) (← links)
- LOCAL CONSTRUCTION AND COLORING OF SPANNERS OF LOCATION AWARE UNIT DISK GRAPHS (Q5189993) (← links)
- Planar Subgraphs without Low-Degree Nodes (Q5199275) (← links)
- Plane and planarity thresholds for random geometric graphs (Q5216443) (← links)
- (Q5226842) (← links)
- MINIMIZING CONGESTION OF LAYOUTS FOR ATM NETWORKS WITH FAULTY LINKS (Q5249024) (← links)
- Searching for majority with k-tuple queries (Q5261043) (← links)
- Linear Search with Terrain-Dependent Speeds (Q5283387) (← links)
- Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs (Q5302070) (← links)
- (Q5310248) (← links)
- Euro-Par 2004 Parallel Processing (Q5311360) (← links)
- Structural Information and Communication Complexity (Q5315223) (← links)
- Structural Information and Communication Complexity (Q5315239) (← links)
- Localization for a System of Colliding Robots (Q5327461) (← links)
- Search on a Line with Faulty Robots (Q5361963) (← links)
- Maintaining Connectivity in Sensor Networks Using Directional Antennae (Q5391111) (← links)
- Survivability of Swarms of Bouncing Robots (Q5405078) (← links)
- Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs (Q5425970) (← links)
- Location Oblivious Distributed Unit Disk Graph Coloring (Q5425972) (← links)
- The Power of Tokens: Rendezvous and Symmetry Detection for Two Mobile Agents in a Ring (Q5448650) (← links)
- (Q5453900) (← links)
- Randomized Rendez-Vous with Limited Memory (Q5458563) (← links)
- Information and Communications Security (Q5464804) (← links)
