| 2007 |
|---|
| 29 | | Ludek Kucera,
Antonín Kucera:
Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007, Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings
Springer 2007 |
| 2006 |
|---|
| 28 | EE | Ludek Kucera,
Stepán Kucera:
Wireless Communication in Random Geometric Topologies.
ALGOSENSORS 2006: 107-118 |
| 2005 |
|---|
| 27 | EE | Ludek Kucera:
Low Degree Connectivity in Ad-Hoc Networks.
ESA 2005: 203-214 |
| 2002 |
|---|
| 26 | | Ludek Kucera:
Graph-Theoretic Concepts in Computer Science, 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers
Springer 2002 |
| 2001 |
|---|
| 25 | EE | Rudolf Fleischer,
Ludek Kucera:
Algorithm Animation for Teaching.
Software Visualization 2001: 113-128 |
| 24 | EE | Ludek Kucera:
Wait-Free Deflection Routing of Long Messages.
IEEE Trans. Parallel Distrib. Syst. 12(5): 476-488 (2001) |
| 1997 |
|---|
| 23 | EE | Ludek Kucera:
Bounds to the Throughput of an Interconnection Network.
SPAA 1997: 139-148 |
| 22 | EE | Ludek Kucera:
Computing OR on a Randomized Fixed Adversary CRCW PRAM.
Inf. Process. Lett. 63(3): 165-166 (1997) |
| 1995 |
|---|
| 21 | EE | Ludek Kucera:
Expected Complexity of Graph Partitioning Problems.
Discrete Applied Mathematics 57(2-3): 193-212 (1995) |
| 1994 |
|---|
| 20 | | Ludek Kucera,
Alberto Marchetti-Spaccamela,
Marco Protasi:
On Learning Monotone DNF Formulae under Uniform Distributions
Inf. Comput. 110(1): 84-95 (1994) |
| 1993 |
|---|
| 19 | | Ludek Kucera,
Kurt Mehlhorn,
B. Preis,
E. Schwarzenecker:
Exact Algorithms for a Geometric Packing Problem (Extended Abstract).
STACS 1993: 317-322 |
| 18 | | Ludek Kucera:
Coloring k-Colorable Graphs in Constant Expected Parallel Time.
WG 1993: 166-176 |
| 1992 |
|---|
| 17 | EE | Michele Flammini,
Alberto Marchetti-Spaccamela,
Ludek Kucera:
Learning DNF Formulae Under Classes of Probability Distributions.
COLT 1992: 85-92 |
| 16 | | Neil J. Calkin,
Alan M. Frieze,
Ludek Kucera:
On the Expected Performance of a Parallel Algorithm for Finding Maximal Independent Subsets of a Random Graph.
Random Struct. Algorithms 3(2): 215-222 (1992) |
| 1991 |
|---|
| 15 | | Ludek Kucera:
A Generalized Encryption Scheme Based on Random Graphs.
WG 1991: 180-186 |
| 14 | | Ludek Kucera:
The Greedy Coloring Is a Bad Probabilistic Algorithm.
J. Algorithms 12(4): 674-684 (1991) |
| 1989 |
|---|
| 13 | | Ludek Kucera:
Graphs with Small Chromatic Numbers are Easy to Color.
Inf. Process. Lett. 30(5): 233-236 (1989) |
| 1988 |
|---|
| 12 | | Ludek Kucera,
Alberto Marchetti-Spaccamela,
Marco Protasi:
On the Learnability of DNF Formulae.
ICALP 1988: 347-361 |
| 11 | | Ludek Kucera,
Vera Trnková:
Isomorphism Testing of Unary Algebras.
SIAM J. Comput. 17(4): 673-686 (1988) |
| 1987 |
|---|
| 10 | | Ludek Kucera:
Canonical Labeling of Regular Graphs in Linear Average Time
FOCS 1987: 271-279 |
| 1986 |
|---|
| 9 | | Ludek Kucera,
Alberto Marchetti-Spaccamela,
Marco Protasi,
Maurizio Talamo:
Near Optimal Algorithms for Finding Minimum Steiner Trees on Random Graphs.
MFCS 1986: 501-511 |
| 1985 |
|---|
| 8 | | Ludek Kucera:
An O(N^(1.5+epsilon)) Expected Time Algorithm for Canonization and Isomorphism Testing of Trivalent Garphs.
STACS 1985: 197-207 |
| 1984 |
|---|
| 7 | | Ludek Kucera:
Finding a Maximum Flow in /S, T/-Planar Network in Linear Expected Time.
MFCS 1984: 370-377 |
| 1982 |
|---|
| 6 | | Ludek Kucera:
Parallel Computation and Conflicts in Memory Access.
Inf. Process. Lett. 14(2): 93-96 (1982) |
| 1981 |
|---|
| 5 | | Ludek Kucera,
Vera Trnková:
Isomorphism Completeness for Some Algebraic Structures.
FCT 1981: 218-225 |
| 4 | | Ludek Kucera:
Maximum Flow in Planar Networks.
MFCS 1981: 418-422 |
| 1980 |
|---|
| 3 | | Ludek Kucera,
Jaroslav Nesetril,
Ales Pultr:
Complexity of Dimension Three and Some Related Edge-Covering Characteristics of Graphs.
Theor. Comput. Sci. 11: 93-106 (1980) |
| 1979 |
|---|
| 2 | | László Babai,
Ludek Kucera:
Canonical Labelling of Graphs in Linear Average Time
FOCS 1979: 39-46 |
| 1977 |
|---|
| 1 | | Ludek Kucera:
Expected Behavior of Graph Coloring Algorithms.
FCT 1977: 447-451 |
