| 2004 |
|---|
| 12 | EE | Marek Piotrów:
Depth Optimal Sorting Networks Resistant to k Passive Faults.
SIAM J. Comput. 33(6): 1484-1512 (2004) |
| 2002 |
|---|
| 11 | EE | Marek Piotrów:
A note on constructing binary heaps with periodic networks.
Inf. Process. Lett. 83(3): 129-134 (2002) |
| 2001 |
|---|
| 10 | EE | Marek Piotrów:
Periodic, random-fault-tolerant correction networks.
SPAA 2001: 298-305 |
| 2000 |
|---|
| 9 | | Piotr Denejko,
Krzysztof Diks,
Andrzej Pelc,
Marek Piotrów:
Reliable Minimum Finding Comparator Networks.
Fundam. Inform. 42(3-4): 235-249 (2000) |
| 1999 |
|---|
| 8 | EE | Marcin Kik,
Miroslaw Kutylowski,
Marek Piotrów:
Correction Networks.
ICPP 1999: 40-47 |
| 1997 |
|---|
| 7 | | Artur Czumaj,
Leszek Gasieniec,
Marek Piotrów,
Wojciech Rytter:
Sequential and Parallel Approximation of Shortest Superstrings.
J. Algorithms 23(1): 74-100 (1997) |
| 1996 |
|---|
| 6 | | Marek Piotrów:
Depth Optimal Sorting Networks Resistant to k Passive Faults.
SODA 1996: 242-251 |
| 1994 |
|---|
| 5 | | Piotr Denejko,
Krzysztof Diks,
Andrzej Pelc,
Marek Piotrów:
Reliable Minimum Finding Comparator Networks.
MFCS 1994: 306-315 |
| 4 | | Artur Czumaj,
Leszek Gasieniec,
Marek Piotrów,
Wojciech Rytter:
Parallel and Sequential Approximations of Shortest Superstrings.
SWAT 1994: 95-106 |
| 1991 |
|---|
| 3 | | Marek Piotrów:
On the Complexity of Counting in the Polynomial Hierarchy.
Theor. Comput. Sci. 81(1): 77-95 (1991) |
| 1988 |
|---|
| 2 | | Marek Piotrów:
On Complexity of Counting.
MFCS 1988: 472-482 |
| 1987 |
|---|
| 1 | | Maciej Liskiewicz,
Krzysztof Lorys,
Marek Piotrów:
On Reversal Bounded Alternating Turing Machines.
Theor. Comput. Sci. 54: 331-339 (1987) |
