Ludek Kucera

42 papers A* 4A 3B 11C 1Journal 12Unranked 10
YearRankTypeTitle / Venue / Authors
2025 — conf
Adapting Computing Curricula in the Era of Automated Software Development.
CompEd (2)
Ludek Kucera, Ildar Akhmetov, Cruz Izu, Olufisayo Omojokun
2025 — conf
Algorithm Visualization - Don't Teach, Let'em Play.
CompEd (2)
Ludek Kucera
2024 — conf
Algovision - An Algorithm Visualization Tool.
SIGCSE (2)
Ludek Kucera
2023 — conf
Teaching Advanced Algorithms in an Undergraduate CS Course: a CGM Case Study.
SIGCSE (2)
Ludek Kucera
2020 — conf
Cognitive and Social Aspects of Visualization in Algorithm Learning.
CSEDU (2)
Ludek Kucera
2020 — ed.
Parallel Computing: Technology Trends, Proceedings of the International Conference on Parallel Computing, PARCO 2019, Prague, Czech Republic, September 10-13, 2019
PARCO
Ian T. Foster, Gerhard R. Joubert, Ludek Kucera, Wolfgang E. Nagel, Frans J. Peters
2018 — conf
Visualization of Abstract Algorithmic Ideas.
CSEDU (1)
Ludek Kucera
2017 — conf
On Architecture for the Future Petascale Computing.
PARCO
Ludek Kucera
2012 J jnl
Efficient Distributed Algorithms for Dynamic Access to Shared Multiuser Channels in SINR-Constrained Wireless Networks.
IEEE Trans. Mob. Comput.
Stepán Kucera, Ludek Kucera, Bing Zhang
2009 J jnl
Foreword.
Theor. Comput. Sci.
Ludek Kucera
2009 — conf
How to Visualise Abstract Topics in Computer and Communication Science.
CSEDU (2)
Ludek Kucera
2009 B conf
Optimum Allocation of Energy and Spectrum in Power-Controlled Wireless Networks with QoS Constraints.
GLOBECOM
Stepán Kucera, Ludek Kucera, Bing Zhang
2007 B ed.
Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007, Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings
MFCS
Ludek Kucera, Antonín Kucera
2006 C conf
Wireless Communication in Random Geometric Topologies.
ALGOSENSORS
Ludek Kucera, Stepán Kucera
2005 A conf
Low Degree Connectivity in Ad-Hoc Networks.
ESA
Ludek Kucera
2002 B ed.
Graph-Theoretic Concepts in Computer Science, 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers
WG
Ludek Kucera
2001 — conf
Algorithm Animation for Teaching.
Software Visualization
Rudolf Fleischer, Ludek Kucera
2001 J jnl
Wait-Free Deflection Routing of Long Messages.
IEEE Trans. Parallel Distributed Syst.
Ludek Kucera
1997 B conf
Bounds to the Throughput of an Interconnection Network.
SPAA
Ludek Kucera
1997 J jnl
Computing OR on a Randomized Fixed Adversary CRCW PRAM.
Inf. Process. Lett.
Ludek Kucera
1995 J jnl
Expected Complexity of Graph Partitioning Problems.
Discret. Appl. Math.
Ludek Kucera
1994 — conf
A Note on Parallel Randomized Algorithms for Searching Problems.
Parallel Processing of Discrete Optimization Problems
Andrea Clemnti, José Rolim, Ludek Kucera
1994 J jnl
On Learning Monotone DNF Formulae under Uniform Distributions
Inf. Comput.
Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi
1993 B conf
Coloring k-Colorable Graphs in Constant Expected Parallel Time.
WG
Ludek Kucera
1993 A conf
Exact Algorithms for a Geometric Packing Problem (Extended Abstract).
STACS
Ludek Kucera, Kurt Mehlhorn, B. Preis, Erik Schwarzenecker
1992 A* conf
Learning DNF Formulae Under Classes of Probability Distributions.
COLT
Michele Flammini, Alberto Marchetti-Spaccamela, Ludek Kucera
1992 J jnl
On the Expected Performance of a Parallel Algorithm for Finding Maximal Independent Subsets of a Random Graph.
Random Struct. Algorithms
Neil J. Calkin, Alan M. Frieze, Ludek Kucera
1991 B conf
A Generalized Encryption Scheme Based on Random Graphs.
WG
Ludek Kucera
1991 J jnl
The Greedy Coloring Is a Bad Probabilistic Algorithm.
J. Algorithms
Ludek Kucera
1989 J jnl
Graphs with Small Chromatic Numbers are Easy to Color.
Inf. Process. Lett.
Ludek Kucera
1988 J jnl
Isomorphism Testing of Unary Algebras.
SIAM J. Comput.
Ludek Kucera, Vera Trnková
1988 A* conf
On the Learnability of DNF Formulae.
ICALP
Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi
1987 A* conf
Canonical Labeling of Regular Graphs in Linear Average Time
FOCS
Ludek Kucera
1986 B conf
Near Optimal Algorithms for Finding Minimum Steiner Trees on Random Graphs.
MFCS
Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi, Maurizio Talamo
1985 A conf
An O(N^(1.5+epsilon)) Expected Time Algorithm for Canonization and Isomorphism Testing of Trivalent Garphs.
STACS
Ludek Kucera
1984 B conf
Finding a Maximum Flow in /S, T/-Planar Network in Linear Expected Time.
MFCS
Ludek Kucera
1982 J jnl
Parallel Computation and Conflicts in Memory Access.
Inf. Process. Lett.
Ludek Kucera
1981 B conf
Isomorphism Completeness for Some Algebraic Structures.
FCT
Ludek Kucera, Vera Trnková
1981 B conf
Maximum Flow in Planar Networks.
MFCS
Ludek Kucera
1980 J jnl
Complexity of Dimension Three and Some Related Edge-Covering Characteristics of Graphs.
Theor. Comput. Sci.
Ludek Kucera, Jaroslav Nesetril, Ales Pultr
1979 A* conf
Canonical Labelling of Graphs in Linear Average Time
FOCS
László Babai, Ludek Kucera
1977 B conf
Expected Behavior of Graph Coloring Algorithms.
FCT
Ludek Kucera