The following pages link to Leszek Gąsieniec (Q352242):
Displaying 50 items.
- (Q235234) (redirect page) (← links)
- Time efficient \(k\)-shot broadcasting in known topology radio networks (Q352244) (← links)
- Choosing the best among peers (Q441881) (← links)
- More efficient periodic traversal in anonymous undirected graphs (Q442265) (← links)
- Position discovery for a system of bouncing robots (Q498402) (← links)
- Doing-it-all with bounded work and communication (Q529041) (← links)
- Space efficient search for maximal repetitions (Q557913) (← links)
- Adaptive broadcasting with faulty nodes (Q671453) (← links)
- Two-dimensional pattern matching by sampling (Q685522) (← links)
- On realizing shapes in the theory of RNA neutral networks (Q776594) (← links)
- Deterministic communication in radio networks with large labels (Q868440) (← links)
- Approximation algorithms for Hamming clustering problems (Q876719) (← links)
- The beachcombers' problem: walking and searching with mobile robots (Q896140) (← links)
- Routing of single-source and multiple-source queries in static sensor networks (Q924537) (← links)
- Fast periodic graph exploration with constant memory (Q931724) (← links)
- Faster multi-witnesses for Boolean matrix multiplication (Q976085) (← links)
- Gathering few fat mobile robots in the plane (Q1004312) (← links)
- Constant-space string-matching in sublinear average time (Q1292492) (← links)
- On the complexity of constructing evolutionary trees (Q1306398) (← links)
- Speeding up two string-matching algorithms (Q1336956) (← links)
- The zooming method: A recursive approach to time-space efficient string-matching (Q1367541) (← links)
- Broadcasting with linearly bounded transmission faults (Q1392531) (← links)
- On polynomial-time approximation algorithms for the variable length scheduling problem. (Q1401344) (← links)
- Algorithms for the parallel alternating direction access machine (Q1575740) (← links)
- Fast practical multi-pattern matching (Q1606976) (← links)
- (Q1679238) (redirect page) (← links)
- When patrolmen become corrupted: monitoring a graph using faulty mobile robots (Q1679239) (← links)
- Information gathering in ad-hoc radio networks with tree topology (Q1686117) (← links)
- Communication and location discovery in geometric ring networks (Q1740645) (← links)
- Linear search by a pair of distinct-speed robots (Q1755792) (← links)
- On adaptive deterministic gossiping in ad hoc radio networks. (Q1853048) (← links)
- Faster communication in known topology radio networks (Q1954206) (← links)
- Information gathering in ad-hoc radio networks (Q2051793) (← links)
- Selected papers of the 31st international workshop on combinatorial algorithms, IWOCA 2020 (Q2088597) (← links)
- On convergence and threshold properties of discrete Lotka-Volterra population protocols (Q2168846) (← links)
- Patrolling on dynamic ring networks (Q2206223) (← links)
- On the curve complexity of 3-colored point-set embeddings (Q2210505) (← links)
- Randomized probe selection algorithm for microarray design (Q2211629) (← links)
- Fair Hitting Sequence Problem: scheduling activities with varied frequency requirements (Q2294049) (← links)
- Asynchronous rendezvous with different maps (Q2303286) (← links)
- Deterministic rendezvous with different maps (Q2323344) (← links)
- Pushing the online matrix-vector conjecture off-line and identifying its easy cases (Q2327098) (← links)
- Efficient broadcasting in radio networks with long-range interference (Q2375820) (← links)
- Fast message dissemination in random geometric networks (Q2375822) (← links)
- Broadcasting in UDG radio networks with unknown topology (Q2377263) (← links)
- Improved approximate common interval (Q2379959) (← links)
- Time efficient centralized gossiping in radio networks (Q2383602) (← links)
- Collision-free network exploration (Q2396820) (← links)
- Robustness of the rotor-router mechanism (Q2408092) (← links)
- The complexity of optimal design of temporally connected graphs (Q2408566) (← links)
