#### Filter Results:

- Full text PDF available (104)

#### Publication Year

1992

2017

- This year (5)
- Last 5 years (36)
- Last 10 years (72)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Maxime Crochemore, Artur Czumaj, +4 authors Wojciech Rytter
- Algorithmica
- 1992

We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF algorithm is based on factor graphs for the reverse of the pattern. The main feature of both algorithms is that they scan the text right-to-left from the supposed right position of… (More)

We consider the problem of distributed deterministic broadcasting in radio networks of unknown topology and size. The network is synchronous. If a node u can be reached from two nodes which send messages in the same round, none of the messages is received by u. Such messages block each other and node u either hears the noise of interference of messages,… (More)

- Leszek Gasieniec, David Peleg, Qin Xin
- Distributed Computing
- 2005

This paper concerns the communication primitives of broadcasting (one-to-all communication) and gossiping (all-to-all communication) in radio networks with known topology, i.e., where for each primitive the schedule of transmissions is precomputed based on full knowledge about the size and the topology of the network.The first part of the paper examines the… (More)

- Artur Czumaj, Leszek Gasieniec, Marek Piotrów, Wojciech Rytter
- J. Algorithms
- 1997

Superstrings have many applications in data compression and genetics. However, the decision version of the shortest superstring problem is N N P P-complete. In this paper we examine the complexity of approximating shortest superstrings. There are two basic measures of the approximations: the length factor and the compression factor. The well known and… (More)

- Marek Chrobak, Leszek Gasieniec, Wojciech Rytter
- J. Algorithms
- 2000

We establish an Ç´Ò ÐÓÓ ¾ Òµ upper bound on the time for deterministic distributed broadcasting in multi-hop radio networks with unknown topology. This nearly matches the known lower bound of ª´Ò ÐÓÓ Òµ. The fastest previously known algorithm for this problem works in time Ç´Ò ¿¾ µ. Using our broadcasting algorithm, we develop an Ç´Ò ¿¾ ÐÓÓ ¾ Òµ algorithm… (More)

- Annalisa De Bonis, Leszek Gasieniec, Ugo Vaccaro
- SIAM J. Comput.
- 2005

- Bogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter
- Distributed Computing
- 2002

We consider the problem of distributed deterministic broadcasting in radio networks of unknown topology and size. The network is synchronous. If a node u can be reached from two nodes which send messages in the same round, none of the messages is received by u. Such messages block each other and node u either hears the noise of interference of messages,… (More)

- Jurek Czyzowicz, Leszek Gasieniec, Andrzej Pelc
- Theor. Comput. Sci.
- 2006

Autonomous identical robots represented by unit discs move deterministically in the plane. They do not have any common coordinate system, do not communicate, do not have memory of the past and are totally asynchronous. Gathering such robots means forming a configuration for which the union of all discs representing them is connected. We solve the gathering… (More)

- Marek Chrobak, Leszek Gasieniec, Wojciech Rytter
- Networks
- 2001

We present an O(n log 4 n)-time randomized algorithm for gossiping in radio networks with unknown topology. This is the first algorithm for gossiping in this model whose running time is only a polylogarithmic factor away from the optimum. The fastest previously known (deter-ministic) algorithm for this problem works in time O(n 3/2 log 2 n).