The following pages link to Evangelos Kranakis (Q215100):
Displaying 50 items.
- Randomized rendezvous with limited memory (Q3189017) (← links)
- God save the queen (Q3305734) (← links)
- Definable Ramsey and definable Erdös ordinals (Q3318770) (← links)
- Definable Partitions and the Projectum (Q3346301) (← links)
- Boolean Functions, Invariance Groups, and Parallel Complexity (Q3361880) (← links)
- (Q3386625) (← links)
- Better adaptive diagnosis of hypercubes (Q3417035) (← links)
- On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols (Q3448801) (← links)
- When Patrolmen Become Corrupted: Monitoring a Graph Using Faulty Mobile Robots (Q3459874) (← links)
- Information Spreading by Mobile Particles on a Line (Q3460722) (← links)
- (Q3485878) (← links)
- Balancing Traffic Load Using One-Turn Rectilinear Routing (Q3502670) (← links)
- Communication in Networks with Random Dependent Faults (Q3525589) (← links)
- Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges (Q3525767) (← links)
- Mobile Agent Rendezvous in a Synchronous Torus (Q3525798) (← links)
- String recognition on anonymous rings (Q3569028) (← links)
- Maximum Interference of Random Sensors on a Line (Q3569126) (← links)
- Strong Orientations of Planar Graphs with Bounded Stretch Factor (Q3569128) (← links)
- Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs (Q3602842) (← links)
- An Algorithmic Theory of Mobile Agents (Q3608454) (← links)
- DEFINABLE ULTRAPOWERS AND ULTRAFILTERS OVER ADMISSIBLE ORDINALS (Q3669385) (← links)
- (Q3689180) (← links)
- Stepping up lemmas in definable partitions (Q3695278) (← links)
- (Q3726186) (← links)
- (Q3751587) (← links)
- (Q3796718) (← links)
- (Q3823129) (← links)
- Reflection and partition properties of admissible ordinals (Q3956926) (← links)
- Definable Ultrafilters and end Extension of Constructible Sets (Q3956927) (← links)
- Invisible Ordinals and Inductive Definitions (Q3956928) (← links)
- A note on weighted distributed match-making (Q4000865) (← links)
- (Q4013245) (← links)
- (Q4038697) (← links)
- (Q4234101) (← links)
- Baked-Potato Routing (Q4238534) (← links)
- Approximating the unsatisfiability threshold of random formulas (Q4240602) (← links)
- (Q4326201) (← links)
- Hop-Congestion Trade-Offs for High-Speed Networks (Q4358514) (← links)
- (Q4375776) (← links)
- (Q4385172) (← links)
- Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory (Q4432766) (← links)
- (Q4436057) (← links)
- (Q4437514) (← links)
- (Q4472476) (← links)
- (Q4474141) (← links)
- (Q4504023) (← links)
- ISOMORPHIC TRIANGULATIONS WITH SMALL NUMBER OF STEINER POINTS (Q4513241) (← links)
- (Q4525052) (← links)
- Lower bounds for compact routing (Q4593958) (← links)
- Approximating the unsatisfiability threshold of random formulas (Extended Abstract) (Q4595474) (← links)
