|
Search the dblp DataBase
Leszek Gasieniec:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Gautam Das, Rudolf Fleischer, Leszek Gasieniec, Dimitrios Gunopulos, Juha Kärkkäinen
Episode Matching. [Citation Graph (1, 0)][DBLP] CPM, 1997, pp:12-27 [Conf]
- György Csizmadia, Jurek Czyzowicz, Leszek Gasieniec, Evangelos Kranakis, Jorge Urrutia
Domino tilings of orthogonal polygons. [Citation Graph (0, 0)][DBLP] CCCG, 1999, pp:- [Conf]
- Marek Chrobak, Leszek Gasieniec, Wojciech Rytter
A Randomized Algorithm for Gossiping in Radio Networks. [Citation Graph (0, 0)][DBLP] COCOON, 2001, pp:483-492 [Conf]
- Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin
On the Complexity of Computing Evolutionary Trees. [Citation Graph (0, 0)][DBLP] COCOON, 1997, pp:134-145 [Conf]
- Dany Breslauer, Leszek Gasieniec
Efficient String Matching on Coded Texts. [Citation Graph (0, 0)][DBLP] CPM, 1995, pp:27-40 [Conf]
- Gerth Stølting Brodal, Leszek Gasieniec
Approximate Dictionary Queries. [Citation Graph (0, 0)][DBLP] CPM, 1996, pp:65-74 [Conf]
- Artur Czumaj, Leszek Gasieniec
On the Complexity of Determining the Period of a String. [Citation Graph (0, 0)][DBLP] CPM, 2000, pp:412-422 [Conf]
- Leszek Gasieniec, Piotr Indyk, Piotr Krysta
External Inverse Pattern Matching. [Citation Graph (0, 0)][DBLP] CPM, 1997, pp:90-101 [Conf]
- Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
Approximation Algorithms for Hamming Clustering Problems. [Citation Graph (0, 0)][DBLP] CPM, 2000, pp:108-118 [Conf]
- Leszek Gasieniec, Roman M. Kolpakov
Real-Time String Matching in Sublinear Space. [Citation Graph (0, 0)][DBLP] CPM, 2004, pp:117-129 [Conf]
- Leszek Gasieniec, Marek Karpinski, Wojciech Plandowski, Wojciech Rytter
Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract). [Citation Graph (0, 0)][DBLP] CPM, 1996, pp:39-49 [Conf]
- Leszek Gasieniec, Wojciech Plandowski, Wojciech Rytter
Constant-Space String Matching with Smaller Number of Comparisons: Sequential Sampling. [Citation Graph (0, 0)][DBLP] CPM, 1995, pp:78-89 [Conf]
- Leszek Gasieniec, Roman M. Kolpakov, Igor Potapov, Paul Sant
Real-Time Traversal in Grammar-Based Compressed Files. [Citation Graph (0, 0)][DBLP] DCC, 2005, pp:458- [Conf]
- Leszek Gasieniec, Wojciech Rytter
Almost Optimal Fully LZW-Compressed Pattern Matching. [Citation Graph (0, 0)][DBLP] Data Compression Conference, 1999, pp:316-325 [Conf]
- Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Lingas, Aris Pagourtzis
Oblivious gossiping in ad-hoc radio networks. [Citation Graph (0, 0)][DBLP] DIAL-M, 2001, pp:44-51 [Conf]
- Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Pelc
Fast Deterministic Simulation of Computations on Faulty Parallel Machines. [Citation Graph (0, 0)][DBLP] ESA, 1995, pp:89-101 [Conf]
- Leszek Gasieniec, Kunsoo Park
Work-Time Optimal Parallel Prefix Matching (Extended Abstract). [Citation Graph (0, 0)][DBLP] ESA, 1994, pp:471-482 [Conf]
- Leszek Gasieniec, Aris Pagourtzis, Igor Potapov
Deterministic Communication in Radio Networks with Large Labels. [Citation Graph (0, 0)][DBLP] ESA, 2002, pp:512-524 [Conf]
- Leszek Gasieniec, Piotr Indyk
Efficient Parallel Computing with Memory Faults. [Citation Graph (0, 0)][DBLP] FCT, 1997, pp:188-197 [Conf]
- Leszek Gasieniec, Igor Potapov
Time/Space Efficient Compressed Pattern Matching. [Citation Graph (0, 0)][DBLP] FCT, 2001, pp:138-149 [Conf]
- Marek Chrobak, Leszek Gasieniec, Wojciech Rytter
Fast Broadcasting and Gossiping in Radio Networks. [Citation Graph (0, 0)][DBLP] FOCS, 2000, pp:575-581 [Conf]
- Richard Cole, Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Kunsoo Park, Wojciech Rytter
Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions [Citation Graph (0, 0)][DBLP] FOCS, 1993, pp:248-258 [Conf]
- Annalisa De Bonis, Leszek Gasieniec, Ugo Vaccaro
Generalized Framework for Selectors with Applications in Optimal Group Testing. [Citation Graph (0, 0)][DBLP] ICALP, 2003, pp:81-96 [Conf]
- Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Kowalski, Tomasz Radzik
On the Wake-Up Problem in Radio Networks. [Citation Graph (0, 0)][DBLP] ICALP, 2005, pp:347-359 [Conf]
- Bogdan S. Chlebus, Leszek Gasieniec, Anna Östlin, John Michael Robson
Deterministic Radio Broadcasting. [Citation Graph (0, 0)][DBLP] ICALP, 2000, pp:717-728 [Conf]
- Malin Christersson, Leszek Gasieniec, Andrzej Lingas
Gossiping with Bounded Size Messages in ad hoc Radio Networks. [Citation Graph (0, 0)][DBLP] ICALP, 2002, pp:377-389 [Conf]
- Leszek Gasieniec, Evangelos Kranakis, Andrzej Pelc, Qin Xin
Deterministic M2M Multicast in Radio Networks: (Extended Abstract). [Citation Graph (0, 0)][DBLP] ICALP, 2004, pp:670-682 [Conf]
- Leszek Gasieniec, Igor Potapov
Gossiping with Unit Messages in Known Radio Networks. [Citation Graph (0, 0)][DBLP] IFIP TCS, 2002, pp:193-205 [Conf]
- Leszek Gasieniec, Chang Su, Prudence W. H. Wong, Qin Xin
Routing via Single-Source and Multiple-Source Queries in Static Sensor Networks. [Citation Graph (0, 0)][DBLP] IPDPS, 2005, pp:- [Conf]
- Prosenjit Bose, Evangelos Kranakis, Danny Krizanc, Miguel Vargas Martin, Jurek Czyzowicz, Andrzej Pelc, Leszek Gasieniec
Strategies for Hotlink Assignments. [Citation Graph (0, 0)][DBLP] ISAAC, 2000, pp:23-34 [Conf]
- Pierre Fraigniaud, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc
Collective Tree Exploration. [Citation Graph (0, 0)][DBLP] LATIN, 2004, pp:141-151 [Conf]
- Bogdan S. Chlebus, Artur Czumaj, Leszek Gasieniec, Miroslaw Kowaluk, Wojciech Plandowski
Parallel Alternating-Direction Access Machine. [Citation Graph (0, 0)][DBLP] MFCS, 1996, pp:267-278 [Conf]
- Leszek Gasieniec, Alan Gibbons, Wojciech Rytter
Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts. [Citation Graph (0, 0)][DBLP] MFCS, 1999, pp:48-58 [Conf]
- Leszek Gasieniec, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
Minimizing Congestion of Layouts for ATM Networks with Faulty Links. [Citation Graph (0, 0)][DBLP] MFCS, 1996, pp:372-381 [Conf]
- Jurek Czyzowicz, Leszek Gasieniec, Andrzej Pelc
Gathering Few Fat Mobile Robots in the Plane. [Citation Graph (0, 0)][DBLP] OPODIS, 2006, pp:350-364 [Conf]
- Leszek Gasieniec, Andrzej Pelc, David Peleg
The wakeup problem in synchronous broadcast systems (extended abstract). [Citation Graph (0, 0)][DBLP] PODC, 2000, pp:113-121 [Conf]
- Leszek Gasieniec, David Peleg, Qin Xin
Faster communication in known topology radio networks. [Citation Graph (0, 0)][DBLP] PODC, 2005, pp:129-137 [Conf]
- Leszek Gasieniec, Igor Potapov, Qin Xin
Time Efficient Gossiping in Known Radio Networks. [Citation Graph (0, 0)][DBLP] SIROCCO, 2004, pp:173-184 [Conf]
- Bogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter
Deterministic broadcasting in unknown radio networks. [Citation Graph (0, 0)][DBLP] SODA, 2000, pp:861-870 [Conf]
- Marek Chrobak, Leszek Gasieniec, Dariusz R. Kowalski
The wake-up problem in multi-hop radio networks. [Citation Graph (0, 0)][DBLP] SODA, 2004, pp:992-1000 [Conf]
- Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
Efficient Approximation Algorithms for the Hamming Center Problem. [Citation Graph (0, 0)][DBLP] SODA, 1999, pp:905-906 [Conf]
- Leszek Gasieniec, Andrzej Lingas
On adaptive deterministic gossiping in ad hoc radio networks. [Citation Graph (0, 0)][DBLP] SODA, 2002, pp:689-690 [Conf]
- Leszek Gasieniec, Evangelos Kranakis, Danny Krizanc, X. Zhang
Optimal Memory Rendezvous of Anonymous Mobile Agents in a Unidirectional Ring. [Citation Graph (0, 0)][DBLP] SOFSEM, 2006, pp:282-292 [Conf]
- Robert Elsässer, Leszek Gasieniec
Radio communication in random graphs: extended abstract. [Citation Graph (0, 0)][DBLP] SPAA, 2005, pp:309-315 [Conf]
- Bogdan S. Chlebus, Leszek Gasieniec
Optimal Pattern Matching on Meshes. [Citation Graph (0, 0)][DBLP] STACS, 1994, pp:213-224 [Conf]
- Maxime Crochemore, Leszek Gasieniec, Wojciech Plandowski, Wojciech Rytter
Two-Dimensional Pattern Matching in Linear Time and Small Space. [Citation Graph (0, 0)][DBLP] STACS, 1995, pp:181-192 [Conf]
- Maxime Crochemore, Thierry Lecroq, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Wojciech Plandowski, Wojciech Rytter
Speeding Up Two String-Matching Algorithms. [Citation Graph (0, 0)][DBLP] STACS, 1992, pp:589-600 [Conf]
- Artur Czumaj, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Plandowski
Work-time-optimal parallel algorithms for string problems. [Citation Graph (0, 0)][DBLP] STOC, 1995, pp:713-722 [Conf]
- Artur Czumaj, Leszek Gasieniec, Marek Piotrów, Wojciech Rytter
Parallel and Sequential Approximations of Shortest Superstrings. [Citation Graph (0, 0)][DBLP] SWAT, 1994, pp:95-106 [Conf]
- Leszek Gasieniec, Marek Karpinski, Wojciech Plandowski, Wojciech Rytter
Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract). [Citation Graph (0, 0)][DBLP] SWAT, 1996, pp:392-403 [Conf]
- Leszek Gasieniec, Tomasz Radzik, Qin Xin
Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks. [Citation Graph (0, 0)][DBLP] SWAT, 2004, pp:397-407 [Conf]
- Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito
Efficient Web Searching Using Temporal Factors. [Citation Graph (0, 0)][DBLP] WADS, 1999, pp:294-305 [Conf]
- Leszek Gasieniec, Andrzej Lingas
An Improved Bound on Boolean Matrix Multiplication for Highly Clustered Data. [Citation Graph (0, 0)][DBLP] WADS, 2003, pp:329-339 [Conf]
- Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Kowalski, Alexander A. Shvartsman
Bounding Work and Communication in Robust Cooperative Computation. [Citation Graph (0, 0)][DBLP] DISC, 2002, pp:295-310 [Conf]
- Maxime Crochemore, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
Speeding Up Two String-Matching Algorithms. [Citation Graph (0, 0)][DBLP] Algorithmica, 1994, v:12, n:4/5, pp:247-267 [Journal]
- Leszek Gasieniec, Andrzej Pelc
Broadcasting with linearly bounded transmission faults. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1998, v:83, n:1-3, pp:121-133 [Journal]
- Bogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter
Deterministic broadcasting in ad hoc radio networks. [Citation Graph (0, 0)][DBLP] Distributed Computing, 2002, v:15, n:1, pp:27-38 [Journal]
- Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Pelc
Deterministic Computations on a PRAM with Static Processor and Memory Faults. [Citation Graph (0, 0)][DBLP] Fundam. Inform., 2003, v:55, n:3-4, pp:285-306 [Journal]
- Leszek Gasieniec, Igor Potapov
Time/Space Efficient Compressed Pattern Matching. [Citation Graph (0, 0)][DBLP] Fundam. Inform., 2003, v:56, n:1-2, pp:137-154 [Journal]
- Leszek Gasieniec, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
Minimizing Congestion of Layouts for ATM Networks with Faulty Links. [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 1999, v:10, n:4, pp:503-512 [Journal]
- Maxime Crochemore, Artur Czumaj, Leszek Gasieniec, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
Fast Practical Multi-Pattern Matching. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1999, v:71, n:3-4, pp:107-113 [Journal]
- Maxime Crochemore, Leszek Gasieniec, Wojciech Rytter
Two-Dimensional Pattern Matching by Sampling. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1993, v:46, n:4, pp:159-162 [Journal]
- Leszek Gasieniec, Andrzej Lingas
On adaptive deterministic gossiping in ad hoc radio networks. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:83, n:2, pp:89-93 [Journal]
- Dany Breslauer, Leszek Gasieniec
Efficient String Matching on Packed Texts. [Citation Graph (0, 0)][DBLP] ITA, 1996, v:30, n:6, pp:521-544 [Journal]
- Marek Chrobak, Leszek Gasieniec, Wojciech Rytter
Fast broadcasting and gossiping in radio networks. [Citation Graph (0, 0)][DBLP] J. Algorithms, 2002, v:43, n:2, pp:177-189 [Journal]
- Artur Czumaj, Leszek Gasieniec, Marek Piotrów, Wojciech Rytter
Sequential and Parallel Approximation of Shortest Superstrings. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1997, v:23, n:1, pp:74-100 [Journal]
- Leszek Gasieniec, Jesper Jansson, Andrzej Lingas, Anna Östlin
On the Complexity of Constructing Evolutionary Trees. [Citation Graph (0, 0)][DBLP] J. Comb. Optim., 1999, v:3, n:2-3, pp:183-197 [Journal]
- Robert Elsässer, Leszek Gasieniec
Radio communication in random graphs. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2006, v:72, n:3, pp:490-506 [Journal]
- Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
Approximation algorithms for Hamming clustering problems. [Citation Graph (0, 0)][DBLP] J. Discrete Algorithms, 2004, v:2, n:2, pp:289-301 [Journal]
- Leszek Gasieniec, Chang Su, Prudence W. H. Wong, Qin Xin
Routing of single-source and multiple-source queries in static sensor networks. [Citation Graph (0, 0)][DBLP] J. Discrete Algorithms, 2007, v:5, n:1, pp:1-11 [Journal]
- Leszek Gasieniec, Andrzej Pelc
Broadcasting with a Bounded Fraction of Faulty Nodes. [Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 1997, v:42, n:1, pp:11-20 [Journal]
- Marek Chrobak, Leszek Gasieniec, Wojciech Rytter
A randomized algorithm for gossiping in radio networks. [Citation Graph (0, 0)][DBLP] Networks, 2004, v:43, n:2, pp:119-124 [Journal]
- Pierre Fraigniaud, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc
Collective tree exploration. [Citation Graph (0, 0)][DBLP] Networks, 2006, v:48, n:3, pp:166-177 [Journal]
- Leszek Gasieniec, Andrzej Pelc
Adaptive Broadcasting with Faulty Nodes. [Citation Graph (0, 0)][DBLP] Parallel Computing, 1996, v:22, n:6, pp:903-912 [Journal]
- Annalisa De Bonis, Leszek Gasieniec, Ugo Vaccaro
Optimal Two-Stage Algorithms for Group Testing Problems. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2005, v:34, n:5, pp:1253-1270 [Journal]
- Maxime Crochemore, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Rytter
Constant-Time Randomized Parallel String Matching. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1997, v:26, n:4, pp:950-960 [Journal]
- Maxime Crochemore, Leszek Gasieniec, Ramesh Hariharan, S. Muthukrishnan, Wojciech Rytter
A Constant Time Optimal Parallel Algorithm for Two-Dimensional Pattern Matching. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1998, v:27, n:3, pp:668-681 [Journal]
- Marek Chrobak, Leszek Gasieniec, Dariusz R. Kowalski
The Wake-Up Problem in MultiHop Radio Networks. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2007, v:36, n:5, pp:1453-1471 [Journal]
- Artur Czumaj, Leszek Gasieniec, Andrzej Pelc
Time and Cost Trade-Offs in Gossiping. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1998, v:11, n:3, pp:400-413 [Journal]
- Leszek Gasieniec, Andrzej Pelc, David Peleg
The Wakeup Problem in Synchronous Broadcast Systems. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2001, v:14, n:2, pp:207-222 [Journal]
- Bogdan S. Chlebus, Artur Czumaj, Leszek Gasieniec, Miroslaw Kowaluk, Wojciech Plandowski
Algorithms for the parallel alternating direction access machine. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2000, v:245, n:2, pp:151-173 [Journal]
- Maxime Crochemore, Leszek Gasieniec, Wojciech Rytter
Constant-Space String-Matching in Sublinear Average Time. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:218, n:1, pp:197-203 [Journal]
- Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito
Efficient web searching using temporal factors. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2001, v:262, n:1, pp:569-582 [Journal]
- Artur Czumaj, Leszek Gasieniec, Daya Ram Gaur, Ramesh Krishnamurti, Wojciech Rytter, Michele Zito
On polynomial-time approximation algorithms for the variable length scheduling problem. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2003, v:302, n:1-3, pp:489-495 [Journal]
- Leszek Gasieniec, Roman M. Kolpakov, Igor Potapov
Space efficient search for maximal repetitions. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:339, n:1, pp:35-48 [Journal]
- Leszek Gasieniec, Evangelos Kranakis, Andrzej Pelc, Qin Xin
Deterministic M2M multicast in radio networks. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:362, n:1-3, pp:196-206 [Journal]
- Leszek Gasieniec, Wojciech Plandowski, Wojciech Rytter
The Zooming Method: A Recursive Approach to Time-Space Efficient String-Matching. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1995, v:147, n:1&2, pp:19-30 [Journal]
- Andrzej Lingas, Leszek Gasieniec
Preface. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:354, n:3, pp:319- [Journal]
- Yuval Emek, Leszek Gasieniec, Erez Kantor, Andrzej Pelc, David Peleg, Chang Su
Broadcasting in udg radio networks with unknown topology. [Citation Graph (0, 0)][DBLP] PODC, 2007, pp:195-204 [Conf]
- Leszek Gasieniec, Ralf Klasing, Russell Martin, Alfredo Navarra, Xiaohui Zhang
Fast Periodic Graph Exploration with Constant Memory. [Citation Graph (0, 0)][DBLP] SIROCCO, 2007, pp:26-40 [Conf]
- Leszek Gasieniec, Andrzej Pelc, Tomasz Radzik, Xiaohui Zhang
Tree exploration with logarithmic memory. [Citation Graph (0, 0)][DBLP] SODA, 2007, pp:585-594 [Conf]
- Leszek Gasieniec, Erez Kantor, Dariusz R. Kowalski, David Peleg, Chang Su
Energy and Time Efficient Broadcasting in Known Topology Radio Networks. [Citation Graph (0, 0)][DBLP] DISC, 2007, pp:253-267 [Conf]
- Leszek Gasieniec, Aris Pagourtzis, Igor Potapov, Tomasz Radzik
Deterministic Communication in Radio Networks with Large Labels. [Citation Graph (0, 0)][DBLP] Algorithmica, 2007, v:47, n:1, pp:97-117 [Journal]
- Leszek Gasieniec, David Peleg, Qin Xin
Faster communication in known topology radio networks. [Citation Graph (0, 0)][DBLP] Distributed Computing, 2007, v:19, n:4, pp:289-300 [Journal]
- Amihood Amir, Leszek Gasieniec, B. Riva Shalom
Improved approximate common interval. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2007, v:103, n:4, pp:142-149 [Journal]
- Leszek Gasieniec, Igor Potapov, Qin Xin
Time efficient centralized gossiping in radio networks. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:383, n:1, pp:45-58 [Journal]
Inferring Ordered Trees from Local Constraints. [Citation Graph (, )][DBLP]
Efficient Probe Selection in Microarray Design. [Citation Graph (, )][DBLP]
Faster Algorithm for the Set Variant of the String Barcoding Problem. [Citation Graph (, )][DBLP]
Tell Me Where I Am So I Can Meet You Sooner. [Citation Graph (, )][DBLP]
Efficient Information Exchange in the Random Phone-Call Model. [Citation Graph (, )][DBLP]
Robustness of the Rotor-router Mechanism. [Citation Graph (, )][DBLP]
Efficient broadcasting in known topology radio networks with long-range interference. [Citation Graph (, )][DBLP]
More Efficient Periodic Traversal in Anonymous Undirected Graphs. [Citation Graph (, )][DBLP]
On Efficient Gossiping in Radio Networks. [Citation Graph (, )][DBLP]
Event Extent Estimation. [Citation Graph (, )][DBLP]
Approximation Algorithms for Buy-at-Bulk Geometric Network Design. [Citation Graph (, )][DBLP]
Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges. [Citation Graph (, )][DBLP]
On Radio Broadcasting in Random Geometric Graphs. [Citation Graph (, )][DBLP]
Euler Tour Lock-In Problem in the Rotor-Router Model. [Citation Graph (, )][DBLP]
Consensus and Mutual Exclusion in a Multiple Access Channel. [Citation Graph (, )][DBLP]
Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids. [Citation Graph (, )][DBLP]
Memory Efficient Anonymous Graph Exploration. [Citation Graph (, )][DBLP]
More efficient periodic traversal in anonymous undirected graphs [Citation Graph (, )][DBLP]
Time efficient k-shot broadcasting in known topology radio networks. [Citation Graph (, )][DBLP]
Broadcasting in UDG radio networks with unknown topology. [Citation Graph (, )][DBLP]
Search in 0.007secs, Finished in 0.562secs
|