The following pages link to Leszek Gąsieniec (Q352242):
Displaying 50 items.
- Efficiently correcting matrix products (Q2408920) (← links)
- Temporal flows in temporal networks (Q2424668) (← links)
- Towards optimal packed string matching (Q2437754) (← links)
- Radio communication in random graphs (Q2495397) (← links)
- Deterministic M2M multicast in radio networks (Q2508975) (← links)
- Pushing the online Boolean matrix-vector multiplication conjecture off-line and identifying its easy cases (Q2656173) (← links)
- The Wakeup Problem in Synchronous Broadcast Systems (Q2719162) (← links)
- (Q2723944) (← links)
- (Q2723970) (← links)
- (Q2754190) (← links)
- On Temporally Connected Graphs of Small Cost (Q2788993) (← links)
- Linear Search by a Pair of Distinct-Speed Robots (Q2835026) (← links)
- Constant-Time Word-Size String Matching (Q2904481) (← links)
- Optimal Packed String Matching (Q2911643) (← links)
- Observe and Remain Silent (Communication-Less Agent Location Discovery) (Q2912740) (← links)
- (Q2934641) (← links)
- Information Gathering in Ad-Hoc Radio Networks with Tree Topology (Q2942388) (← links)
- Efficiently Correcting Matrix Products (Q2942613) (← links)
- Rendezvous Problem (Q2961403) (← links)
- Bamboo Garden Trimming Problem (Perpetual Maintenance of Machines with Different Attendance Urgency Factors) (Q2971137) (← links)
- Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds (Q3092272) (← links)
- Synchronous Rendezvous for Location-Aware Agents (Q3095348) (← links)
- Sequential and Parallel Approximation of Shortest Superstrings (Q3128987) (← links)
- Fast broadcasting and gossiping in radio networks (Q3150281) (← links)
- Deterministic Population Protocols for Exact Majority and Plurality. (Q3174938) (← links)
- Approximation Algorithms for Buy-at-Bulk Geometric Network Design (Q3183450) (← links)
- Tree exploration with logarithmic memory (Q3188999) (← links)
- APPROXIMATION ALGORITHMS FOR BUY-AT-BULK GEOMETRIC NETWORK DESIGN (Q3224959) (← links)
- On Efficient Gossiping in Radio Networks (Q3408156) (← links)
- More Efficient Periodic Traversal in Anonymous Undirected Graphs (Q3408168) (← links)
- Collective tree exploration (Q3423884) (← 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)
- Faster Algorithm for the Set Variant of the String Barcoding Problem (Q3506944) (← links)
- Energy and Time Efficient Broadcasting in Known Topology Radio Networks (Q3523212) (← links)
- On Radio Broadcasting in Random Geometric Graphs (Q3540232) (← links)
- Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges (Q3540236) (← links)
- Event Extent Estimation (Q3569116) (← links)
- Efficient Information Exchange in the Random Phone-Call Model (Q3587433) (← links)
- Tell Me Where I Am So I Can Meet You Sooner (Q3587463) (← links)
- Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids (Q3588310) (← links)
- Euler Tour Lock-In Problem in the Rotor-Router Model (Q3646241) (← links)
- Consensus and Mutual Exclusion in a Multiple Access Channel (Q3646247) (← links)
- Time and Cost Trade-Offs in Gossiping (Q4210214) (← links)
- (Q4234122) (← links)
- (Q4252402) (← links)
- Efficient string matching on packed texts (Q4341037) (← links)
- (Q4364583) (← links)
- Constant-Time Randomized Parallel String Matching (Q4376173) (← links)
- (Q4411387) (← links)
