Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Ludek Kucera
2010 – today
- 2012
[j12]Stepán Kucera, Ludek Kucera, Bing Zhang: Efficient Distributed Algorithms for Dynamic Access to Shared Multiuser Channels in SINR-Constrained Wireless Networks. IEEE Trans. Mob. Comput. 11(12): 2087-2097 (2012)
2000 – 2009
- 2009
[j11]
[c19]Ludek Kucera: How to Visualise Abstract Topics in Computer and Communication Science. CSEDU (2) 2009: 313-317
[c18]Stepán Kucera, Ludek Kucera, Bing Zhang: Optimum Allocation of Energy and Spectrum in Power-Controlled Wireless Networks with QoS Constraints. GLOBECOM 2009: 1-6- 2007
[e2]Ludek Kucera, Antonín Kucera (Eds.): Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007, Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings. Lecture Notes in Computer Science 4708, Springer 2007, ISBN 978-3-540-74455-9- 2006
[c17]Ludek Kucera, Stepán Kucera: Wireless Communication in Random Geometric Topologies. ALGOSENSORS 2006: 107-118- 2005
[c16]- 2002
[e1]Ludek Kucera (Ed.): Graph-Theoretic Concepts in Computer Science, 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers. Lecture Notes in Computer Science 2573, Springer 2002, ISBN 3-540-00331-2- 2001
[j10]Ludek Kucera: Wait-Free Deflection Routing of Long Messages. IEEE Trans. Parallel Distrib. Syst. 12(5): 476-488 (2001)
[c15]Rudolf Fleischer, Ludek Kucera: Algorithm Animation for Teaching. Software Visualization 2001: 113-128
1990 – 1999
- 1997
[j9]Ludek Kucera: Computing OR on a Randomized Fixed Adversary CRCW PRAM. Inf. Process. Lett. 63(3): 165-166 (1997)
[c14]- 1995
[j8]Ludek Kucera: Expected Complexity of Graph Partitioning Problems. Discrete Applied Mathematics 57(2-3): 193-212 (1995)- 1994
[j7]Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi: On Learning Monotone DNF Formulae under Uniform Distributions. Inf. Comput. 110(1): 84-95 (1994)- 1993
[c13]Ludek Kucera, Kurt Mehlhorn, B. Preis, E. Schwarzenecker: Exact Algorithms for a Geometric Packing Problem (Extended Abstract). STACS 1993: 317-322
[c12]- 1992
[j6]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)
[c11]Michele Flammini, Alberto Marchetti-Spaccamela, Ludek Kucera: Learning DNF Formulae Under Classes of Probability Distributions. COLT 1992: 85-92- 1991
[j5]Ludek Kucera: The Greedy Coloring Is a Bad Probabilistic Algorithm. J. Algorithms 12(4): 674-684 (1991)
[c10]
1980 – 1989
- 1989
[j4]Ludek Kucera: Graphs with Small Chromatic Numbers are Easy to Color. Inf. Process. Lett. 30(5): 233-236 (1989)- 1988
[j3]Ludek Kucera, Vera Trnková: Isomorphism Testing of Unary Algebras. SIAM J. Comput. 17(4): 673-686 (1988)
[c9]Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi: On the Learnability of DNF Formulae. ICALP 1988: 347-361- 1987
[c8]- 1986
[c7]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
[c6]Ludek Kucera: An O(N^(1.5+epsilon)) Expected Time Algorithm for Canonization and Isomorphism Testing of Trivalent Garphs. STACS 1985: 197-207- 1984
[c5]Ludek Kucera: Finding a Maximum Flow in /S, T/-Planar Network in Linear Expected Time. MFCS 1984: 370-377- 1982
[j2]Ludek Kucera: Parallel Computation and Conflicts in Memory Access. Inf. Process. Lett. 14(2): 93-96 (1982)- 1981
[c4]Ludek Kucera, Vera Trnková: Isomorphism Completeness for Some Algebraic Structures. FCT 1981: 218-225
[c3]- 1980
[j1]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)
1970 – 1979
- 1979
[c2]- 1977
[c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 21:48 CET by the dblp team



