| 2008 |
|---|
| 64 | EE | Krzysztof Diks,
Jan Madey:
From Top Coders to Top IT Professionals.
ISSEP 2008: 31-40 |
| 2007 |
|---|
| 63 | EE | Krzysztof Diks,
Piotr Sankowski:
Dynamic Plane Transitive Closure.
ESA 2007: 594-604 |
| 2006 |
|---|
| 62 | EE | Krzysztof Diks,
Stefan Dobrev,
Andrzej Pelc:
Exploring Planar Graphs Using Unoriented Maps.
Journal of Interconnection Networks 7(3): 353-373 (2006) |
| 2004 |
|---|
| 61 | EE | Krzysztof Diks,
Pierre Fraigniaud,
Evangelos Kranakis,
Andrzej Pelc:
Tree exploration with little memory.
J. Algorithms 51(1): 38-63 (2004) |
| 2002 |
|---|
| 60 | | Krzysztof Diks,
Wojciech Rytter:
Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings
Springer 2002 |
| 59 | EE | Krzysztof Diks,
Pierre Fraigniaud,
Evangelos Kranakis,
Andrzej Pelc:
Tree exploration with little memory.
SODA 2002: 588-597 |
| 58 | EE | Krzysztof Diks,
Lukasz Kowalik,
Maciej Kurowski:
A New 3-Color Criterion for Planar Graphs.
WG 2002: 138-149 |
| 57 | | Krzysztof Diks,
Evangelos Kranakis,
Danny Krizanc,
Andrzej Pelc:
The impact of information on broadcasting time in linear radio networks.
Theor. Comput. Sci. 287(2): 449-471 (2002) |
| 2000 |
|---|
| 56 | EE | Krzysztof Diks,
Andrzej Pelc:
Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes.
Algorithmica 28(1): 37-50 (2000) |
| 55 | | Piotr Denejko,
Krzysztof Diks,
Andrzej Pelc,
Marek Piotrów:
Reliable Minimum Finding Comparator Networks.
Fundam. Inform. 42(3-4): 235-249 (2000) |
| 1999 |
|---|
| 54 | EE | Krzysztof Diks,
Evangelos Kranakis,
Danny Krizanc,
Andrzej Pelc:
The Impact of Knowledge on Broadcasting Time in Radio Networks.
ESA 1999: 41-52 |
| 53 | | Krzysztof Diks,
Andrzej Lingas,
Andrzej Pelc:
An Optimal Algorithm for Broadcasting Multiple Messages in Trees.
J. Parallel Distrib. Comput. 59(3): 465-474 (1999) |
| 1998 |
|---|
| 52 | EE | Krzysztof Diks,
Evangelos Kranakis,
Andrzej Pelc:
Perfect Broadcasting in Unlabeled Networks.
Discrete Applied Mathematics 87(1-3): 33-47 (1998) |
| 51 | EE | Krzysztof Diks,
Stefan Dobrev,
Evangelos Kranakis,
Andrzej Pelc,
Peter Ruzicka:
Broadcasting in Unlabeled Hypercubes with a Linear Number of Messages.
Inf. Process. Lett. 66(4): 181-186 (1998) |
| 50 | | Krzysztof Diks,
Evangelos Kranakis,
Andrzej Pelc:
Broadcasting in Unlabeled Tori.
Parallel Processing Letters 8(2): 177-188 (1998) |
| 49 | EE | Krzysztof Diks,
Andrzej Pelc:
System Diagnosis with Smallest Risk of Error.
Theor. Comput. Sci. 203(1): 163-173 (1998) |
| 48 | EE | Krzysztof Diks,
Torben Hagerup:
More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree.
Theor. Comput. Sci. 203(1): 3-29 (1998) |
| 1997 |
|---|
| 47 | | Krzysztof Diks,
Andrzej Pelc:
Optimal Adaptive Broadcasting with a Bounded Fraction of Faulty Nodes (Extended Abstract).
ESA 1997: 118-129 |
| 46 | | Krzysztof Diks,
Andrzej Lingas,
Andrzej Pelc:
An Optimal Algorithm for Broadcasting Multiple Messages in Trees.
SIROCCO 1997: 69-80 |
| 45 | | Bogdan S. Chlebus,
Krzysztof Diks,
Andrzej Pelc:
Transition-Optimal Token Distribution.
Fundam. Inform. 32(3-4): 313-328 (1997) |
| 44 | | Krzysztof Diks,
Andrzej Pelc:
Globally Optimal Diagnosis in Systems with Random Faults.
IEEE Trans. Computers 46(2): 200-204 (1997) |
| 43 | | Piotr Berman,
Krzysztof Diks,
Andrzej Pelc:
Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures.
J. Algorithms 22(2): 199-211 (1997) |
| 1996 |
|---|
| 42 | | Krzysztof Diks,
Torben Hagerup:
More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree.
WG 1996: 126-140 |
| 41 | | Krzysztof Diks,
Andrzej Pelc:
System Diagnosis with Smallest Risk of Error.
WG 1996: 141-150 |
| 40 | | Bogdan S. Chlebus,
Krzysztof Diks,
Andrzej Pelc:
Reliable Broadcasting in Hypercubes with Random Link and Node Failures.
Combinatorics, Probability & Computing 5: 337-350 (1996) |
| 39 | EE | Artur Czumaj,
Krzysztof Diks,
Teresa M. Przytycka:
Parallel Maximum Independent Set in Convex Bipartite Graphs.
Inf. Process. Lett. 59(6): 289-294 (1996) |
| 38 | EE | Krzysztof Diks,
Andrzej Pelc:
Broadcasting with universal lists.
Networks 27(3): 183-196 (1996) |
| 37 | | Krzysztof Diks,
Andrzej Pelc:
Fault-Tolerant Linear Broadcasting.
Nord. J. Comput. 3(2): 188-201 (1996) |
| 36 | EE | Krzysztof Diks,
Andrzej Pelc:
Reliable Computations on Faulty EREW PRAM.
Theor. Comput. Sci. 164(1&2): 107-122 (1996) |
| 1995 |
|---|
| 35 | EE | Krzysztof Diks,
Andrzej Pelc:
Broadcasting with universal lists.
HICSS (2) 1995: 564-573 |
| 34 | | Bogdan S. Chlebus,
Krzysztof Diks,
Miroslaw Kowaluk:
O(log log n)-Time Integer Geometry on the CRCW PRAM.
Algorithmica 14(1): 52-69 (1995) |
| 33 | | Krzysztof Diks,
Adam Malinowski,
Andrzej Pelc:
Token Transfer in a Faulty Network.
ITA 29(5): 383-400 (1995) |
| 32 | EE | Krzysztof Diks,
Evangelos Kranakis,
Adam Malinowski,
Andrzej Pelc:
Anonymous Wireless Rings.
Theor. Comput. Sci. 145(1&2): 95-109 (1995) |
| 1994 |
|---|
| 31 | | Krzysztof Diks,
Andrzej Pelc:
Fault-Tolerant Linear Broadcasting.
Canada-France Conference on Parallel and Distributed Computing 1994: 207-217 |
| 30 | | Bogdan S. Chlebus,
Krzysztof Diks,
Andrzej Pelc:
Waking up an Anonymous Faulty Network from a Single Source.
HICSS (2) 1994: 187-193 |
| 29 | | Piotr Denejko,
Krzysztof Diks,
Andrzej Pelc,
Marek Piotrów:
Reliable Minimum Finding Comparator Networks.
MFCS 1994: 306-315 |
| 28 | | Krzysztof Diks,
Evangelos Kranakis,
A. Malinowsky,
Andrzej Pelc:
The Buffer Potential of a Network.
SIROCCO 1994: 149-150 |
| 27 | | Bogdan S. Chlebus,
Krzysztof Diks,
Andrzej Pelc:
Fast gossiping with short unreliable messages.
Discrete Applied Mathematics 53(1-3): 15-24 (1994) |
| 26 | | Krzysztof Diks,
Evangelos Kranakis,
Danny Krizanc,
Bernard Mans,
Andrzej Pelc:
Optimal Coteries and Voting Schemes.
Inf. Process. Lett. 51(1): 1-6 (1994) |
| 25 | | Bogdan S. Chlebus,
Krzysztof Diks,
Andrzej Pelc:
Sparse Networks Supporting Efficient Reliable Broadcasting.
Nord. J. Comput. 1(3): 332-345 (1994) |
| 24 | | Krzysztof Diks,
Adam Malinowski,
Andrzej Pelc:
Reliable Token Despersal with Random Faults.
Parallel Processing Letters 4: 417-427 (1994) |
| 23 | EE | Bogdan S. Chlebus,
Krzysztof Diks,
Andrzej Pelc:
Sorting on a Mesh-Connected Computer with Delaying Links.
SIAM J. Discrete Math. 7(1): 119-132 (1994) |
| 1993 |
|---|
| 22 | | Bogdan S. Chlebus,
Krzysztof Diks,
Andrzej Pelc:
Sparse Networks Supporting Efficient Reliable Broadcasting.
ICALP 1993: 388-397 |
| 21 | | Krzysztof Diks,
Andrzej Pelc:
Fast Diagnosis of Multiprocessor Systems with Random Faults.
ITA 27(5): 391-401 (1993) |
| 20 | | Krzysztof Diks,
Oscar Garrido,
Andrzej Lingas:
Parallel Algorithms for Finding Maximal k-Dependent Sets and Maximal f-Matchings.
Int. J. Found. Comput. Sci. 4(2): 179-192 (1993) |
| 19 | | Krzysztof Diks,
Hristo Djidjev,
Ondrej Sýkora,
Imrich Vrto:
Edge Separators of Planar and Outerplanar Graphs with Applications.
J. Algorithms 14(2): 258-279 (1993) |
| 1992 |
|---|
| 18 | | Krzysztof Diks,
Andrzej Pelc:
Almost Safe Gossiping in Bounded Degree Networks.
SIAM J. Discrete Math. 5(3): 338-344 (1992) |
| 1991 |
|---|
| 17 | | Bogdan S. Chlebus,
Krzysztof Diks,
Andrzej Pelc:
Optimal Broadcasting in Faulty Hypercubes.
FTCS 1991: 266-273 |
| 16 | | Krzysztof Diks,
Oscar Garrido,
Andrzej Lingas:
Parallel Algorithms for Finding Maximal k-Dependent Sets and Maximal f-Matchings.
ISA 1991: 385-395 |
| 15 | | P. C. P. Bhatt,
Krzysztof Diks,
Torben Hagerup,
V. C. Prasad,
Tomasz Radzik,
Sanjeev Saxena:
Improved Deterministic Parallel Integer Sorting
Inf. Comput. 94(1): 29-47 (1991) |
| 14 | | Krzysztof Diks,
Wojciech Rytter:
On Optimal Parallel Computations for Sequences of Brackets.
Theor. Comput. Sci. 87(2): 251-262 (1991) |
| 1989 |
|---|
| 13 | | Bogdan S. Chlebus,
Krzysztof Diks,
Torben Hagerup,
Tomasz Radzik:
New Simulations between CRCW PRAMs.
FCT 1989: 95-104 |
| 12 | | Bogdan S. Chlebus,
Krzysztof Diks,
Wojciech Rytter,
Tomasz Szymacha:
Parallel Complexity of Lexicographically First Order Problems for Tree-Structured Graphs (Extended Abstract).
MFCS 1989: 185-195 |
| 11 | | Krzysztof Diks,
Torben Hagerup,
Wojciech Rytter:
Optimal Parallel Algorithms For The Recognition And Colouring Outerplanar Graphs (Extended Abstract).
MFCS 1989: 207-217 |
| 10 | | Krzysztof Diks,
Wojciech Rytter:
Optimal Parallel Computations for Halin Graphs.
Optimal Algorithms 1989: 266-273 |
| 9 | | Torben Hagerup,
Marek Chrobak,
Krzysztof Diks:
Optimal Parallel 5-Colouring of Planar Graphs.
SIAM J. Comput. 18(2): 288-300 (1989) |
| 1988 |
|---|
| 8 | | Bogdan S. Chlebus,
Krzysztof Diks,
Tomasz Radzik:
Testing Isomorphism of Outerplanar Graphs in Parallel.
MFCS 1988: 220-230 |
| 7 | | Bogdan S. Chlebus,
Krzysztof Diks,
Torben Hagerup,
Tomasz Radzik:
Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models.
MFCS 1988: 231-239 |
| 6 | | Krzysztof Diks,
Hristo Djidjev,
Ondrej Sýkora,
Imrich Vrto:
Edge Separators for Planar Graphs and Their Applications.
MFCS 1988: 280-290 |
| 1987 |
|---|
| 5 | | Bogdan S. Chlebus,
Marek Chrobak,
Krzysztof Diks:
Saturating Flows in Networks.
FCT 1987: 82-91 |
| 4 | | Torben Hagerup,
Marek Chrobak,
Krzysztof Diks:
Parallel 5-Colouring of Planar Graphs.
ICALP 1987: 304-313 |
| 3 | | Krzysztof Diks:
Parallel Recognition of Outerplanar Graphs.
Parallel Algorithms and Architectures 1987: 105-113 |
| 1986 |
|---|
| 2 | | Krzysztof Diks:
A Fast Parallel Algorithm for Six-Colouring of Planar Graphs (Extended Abstract).
MFCS 1986: 273-282 |
| 1985 |
|---|
| 1 | | Krzysztof Diks:
Embeddings of Binary Trees in Lines.
Theor. Comput. Sci. 36: 319-331 (1985) |
