Ludek Kucera - researchr alias

researchr

You are not signed in
Sign in
Sign up

2009

ForewordLudek Kucera. TCS, 410(50):5201, 2009. [doi]

Optimum Allocation of Energy and Spectrum in Power-Controlled Wireless Networks with QoS ConstraintsStepÃ¡n Kucera, Ludek Kucera, Bing Zhang. globecom 2009: 1-6 [doi]

How to Visualise Abstract Topics in Computer and Communication ScienceLudek Kucera. csedu 2009: 313-317

2007

Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007, Ceský Krumlov, Czech Republic, August 26-31, 2007, ProceedingsLudek Kucera, Antonín Kucera, editors, Volume 4708 of Lecture Notes in Computer Science, Springer, 2007.

2006

Wireless Communication in Random Geometric TopologiesLudek Kucera, Stepán Kucera. algosensors 2006: 107-118 [doi]

2005

Low Degree Connectivity in Ad-Hoc NetworksLudek Kucera. esa 2005: 203-214 [doi]

2002

Graph-Theoretic Concepts in Computer Science, 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised PapersLudek Kucera, editor, Volume 2573 of Lecture Notes in Computer Science, Springer, 2002.

2001

Algorithm Animation for TeachingRudolf Fleischer, Ludek Kucera. dagstuhl 2002: 113-128 [doi]

Wait-Free Deflection Routing of Long MessagesLudek Kucera. tpds, 12(5):476-488, 2001. [doi]

1997

Bounds to the Throughput of an Interconnection NetworkLudek Kucera. spaa 1997: 139-148 [doi]

Computing OR on a Randomized Fixed Adversary CRCW PRAMLudek Kucera. ipl, 63(3):165-166, 1997. [doi]

1995

Expected Complexity of Graph Partitioning ProblemsLudek Kucera. DAM, 57(2-3):193-212, 1995. [doi]

1994

On Learning Monotone DNF Formulae under Uniform DistributionsLudek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi. iandc, 110(1):84-95, April 1994.

1993

Coloring k-Colorable Graphs in Constant Expected Parallel TimeLudek Kucera. criwg 1994: 166-176

Exact Algorithms for a Geometric Packing Problem (Extended Abstract)Ludek Kucera, Kurt Mehlhorn, B. Preis, E. Schwarzenecker. STACS 1993: 317-322

1992

On the Expected Performance of a Parallel Algorithm for Finding Maximal Independent Subsets of a Random GraphNeil J. Calkin, Alan M. Frieze, Ludek Kucera. rsa, 3(2):215-222, 1992.

Learning DNF Formulae Under Classes of Probability DistributionsMichele Flammini, Alberto Marchetti-Spaccamela, Ludek Kucera. colt 1992: 85-92 [doi]

1991

The Greedy Coloring Is a Bad Probabilistic AlgorithmLudek Kucera. jal, 12(4):674-684, 1991.

A Generalized Encryption Scheme Based on Random GraphsLudek Kucera. criwg 1992: 180-186

1989

Graphs with Small Chromatic Numbers are Easy to ColorLudek Kucera. ipl, 30(5):233-236, 1989.

1988

On the Learnability of DNF FormulaeLudek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi. icalp 1988: 347-361

Isomorphism Testing of Unary AlgebrasLudek Kucera, Vera Trnková. siamcomp, 17(4):673-686, 1988.

1987

Canonical Labeling of Regular Graphs in Linear Average TimeLudek Kucera. focs 1987: 271-279

1986

Near Optimal Algorithms for Finding Minimum Steiner Trees on Random GraphsLudek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi, Maurizio Talamo. mfcs 1986: 501-511

1985

An O(N^(1.5+epsilon)) Expected Time Algorithm for Canonization and Isomorphism Testing of Trivalent GarphsLudek Kucera. STACS 1985: 197-207

1984

Finding a Maximum Flow in /S, T/-Planar Network in Linear Expected TimeLudek Kucera. mfcs 1984: 370-377

1982

Parallel Computation and Conflicts in Memory AccessLudek Kucera. ipl, 14(2):93-96, 1982.

1981

Isomorphism Completeness for Some Algebraic StructuresLudek Kucera, Vera Trnková. fct 1981: 218-225

Maximum Flow in Planar NetworksLudek Kucera. mfcs 1981: 418-422

1980

Complexity of Dimension Three and Some Related Edge-Covering Characteristics of GraphsLudek Kucera, Jaroslav Nesetril, Ales Pultr. TCS, 11:93-106, 1980.

1979

Canonical Labelling of Graphs in Linear Average TimeLászló Babai, Ludek Kucera. focs 1979: 39-46

1977

Expected Behavior of Graph Coloring AlgorithmsLudek Kucera. fct 1977: 447-451