The following pages link to Evangelos Kranakis (Q215100):
Displaying 50 items.
- (Q169862) (redirect page) (← links)
- On the event distance of Poisson processes with applications to sensors (Q477345) (← links)
- Position discovery for a system of bouncing robots (Q498402) (← links)
- Localization for a system of colliding robots (Q498669) (← links)
- Distributed algorithms for barrier coverage using relocatable sensors (Q518925) (← links)
- Location-oblivious distributed unit disk graph coloring (Q534767) (← links)
- Deterministic symmetric rendezvous with tokens in a synchronous torus (Q540154) (← links)
- Fixed point equations with parameters in the projective model (Q580971) (← links)
- Analysing local algorithms in location-aware quasi-unit-disk graphs (Q642985) (← links)
- Anonymous wireless rings (Q673090) (← links)
- Computing majority with triple queries (Q690459) (← links)
- Maintaining privacy on a line (Q692927) (← links)
- On the page number of RNA secondary structures with pseudoknots (Q694703) (← links)
- On realizing shapes in the theory of RNA neutral networks (Q776594) (← links)
- Bike assisted evacuation on a line (Q831791) (← links)
- Asymptotic expected number of base pairs in optimal secondary structure for random RNA using the Nussinov--Jacobson energy model (Q876474) (← links)
- The beachcombers' problem: walking and searching with mobile robots (Q896140) (← links)
- Strong connectivity of sensor networks with double antennae (Q896697) (← links)
- Memoryless search algorithms in a network with faulty advice (Q935471) (← links)
- On the false-positive rate of Bloom filters (Q975449) (← links)
- Constant memory routing in quasi-planar and quasi-polyhedral graphs (Q1003732) (← links)
- Optimal movement of mobile sensors for barrier coverage of a planar region (Q1040594) (← links)
- Random maximal independent sets and the unfriendly theater seating arrangement problem (Q1044988) (← links)
- Definable partitions and reflection properties for regular cardinals (Q1071016) (← links)
- A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments (Q1128998) (← links)
- Perfect broadcasting in unlabeled networks (Q1270770) (← links)
- Approximate maxima finding of continuous functions under restricted budget (Q1274326) (← links)
- Optimal coteries and voting schemes (Q1328755) (← links)
- Camera placement in integer lattices (Q1330888) (← links)
- Computing Boolean functions on anonymous networks (Q1341773) (← links)
- Stage-graph representations (Q1363763) (← links)
- The VC-dimension of set systems defined by graphs (Q1364472) (← links)
- Planar stage graphs: Characterizations and applications (Q1392202) (← links)
- Searching with mobile agents in networks with liars. (Q1422406) (← links)
- Sorting and election in anonymous asynchronous rings. (Q1427459) (← links)
- Efficient regular polygon dissections (Q1573694) (← links)
- Power consumption in packet radio networks (Q1575645) (← links)
- Search-and-fetch with one robot on a disk (track: wireless and geometry) (Q1629940) (← links)
- Patrolling trees with mobile robots (Q1631946) (← links)
- Impact of locality on location aware unit disk graphs (Q1662429) (← links)
- When patrolmen become corrupted: monitoring a graph using faulty mobile robots (Q1679239) (← links)
- Evacuating two robots from multiple unknown exits in a circle (Q1686109) (← links)
- Know when to persist: deriving value from a stream buffer (Q1704857) (← links)
- Priority evacuation from a disk using mobile robots (extended abstract) (Q1713933) (← links)
- Evacuation from a disc in the presence of a faulty robot (Q1742766) (← links)
- Strongly connected orientations of plane graphs (Q1759876) (← links)
- Counting problems relating to a theorem of Dirichlet (Q1841992) (← links)
- The impact of information on broadcasting time in linear radio networks. (Q1853489) (← links)
- Labeled versus unlabeled distributed Cayley networks (Q1917232) (← links)
- Search on a line with faulty robots (Q2010608) (← links)
