Ludek Kucera
http://kam.mff.cuni.cz/~ludek/
https://orcid.org/0000-0002-5718-6120
Ludek Kucera
Algovision - An Algorithm Visualization Tool.
1925
2024
SIGCSE (2)
https://doi.org/10.1145/3626253.3635424
conf/sigcse/2024-2
db/conf/sigcse/sigcse2024-2.html#Kucera24
Ludek Kucera
Teaching Advanced Algorithms in an Undergraduate CS Course: a CGM Case Study.
1404
2023
SIGCSE (2)
https://doi.org/10.1145/3545947.3576348
conf/sigcse/2023-2
db/conf/sigcse/sigcse2023-2.html#Kucera23
Ludek Kucera
Cognitive and Social Aspects of Visualization in Algorithm Learning.
270-277
2020
CSEDU (2)
https://doi.org/10.5220/0009359102700277
conf/csedu/2020-2
db/conf/csedu/csedu2020-2.html#Kucera20
Ian T. Foster
Gerhard R. Joubert
Ludek Kucera
Wolfgang E. Nagel
Frans J. Peters
Parallel Computing: Technology Trends, Proceedings of the International Conference on Parallel Computing, PARCO 2019, Prague, Czech Republic, September 10-13, 2019
IOS Press
2020
PARCO
Advances in Parallel Computing
36
978-1-64368-070-5
978-1-64368-071-2
https://doi.org/10.3233/APC36
db/conf/parco/parco2019.html
Ludek Kucera
Visualization of Abstract Algorithmic Ideas.
497-504
2018
CSEDU (1)
https://doi.org/10.5220/0006810104970504
conf/csedu/2018-1
db/conf/csedu/csedu2018-1.html#Kucera18
Ludek Kucera
On Architecture for the Future Petascale Computing.
211-220
2017
PARCO
https://doi.org/10.3233/978-1-61499-843-3-211
conf/parco/2017
db/conf/parco/parco2017.html#Kucera17
Stepán Kucera
Ludek Kucera
Bing Zhang 0002
Efficient Distributed Algorithms for Dynamic Access to Shared Multiuser Channels in SINR-Constrained Wireless Networks.
2087-2097
2012
11
IEEE Trans. Mob. Comput.
12
https://doi.org/10.1109/TMC.2011.236
http://doi.ieeecomputersociety.org/10.1109/TMC.2011.236
db/journals/tmc/tmc11.html#KuceraKZ12
Ludek Kucera
Foreword.
5201
2009
410
Theor. Comput. Sci.
50
https://doi.org/10.1016/j.tcs.2009.08.021
db/journals/tcs/tcs410.html#Kucera09
Ludek Kucera
How to Visualise Abstract Topics in Computer and Communication Science.
313-317
2009
CSEDU (2)
conf/csedu/2009-2
db/conf/csedu/csedu2009-2.html#Kucera09
Stepán Kucera
Ludek Kucera
Bing Zhang 0002
Optimum Allocation of Energy and Spectrum in Power-Controlled Wireless Networks with QoS Constraints.
1-6
2009
GLOBECOM
https://doi.org/10.1109/GLOCOM.2009.5425240
conf/globecom/2009
db/conf/globecom/globecom2009.html#KuceraKZ09
Ludek Kucera
Antonín Kucera 0001
Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007, Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings
MFCS
Lecture Notes in Computer Science
4708
Springer
2007
978-3-540-74455-9
https://doi.org/10.1007/978-3-540-74456-6
db/conf/mfcs/mfcs2007.html
Ludek Kucera
Stepán Kucera
Wireless Communication in Random Geometric Topologies.
107-118
2006
conf/algosensors/2006
ALGOSENSORS
https://doi.org/10.1007/11963271_10
db/conf/algosensors/algosensors2006.html#KuceraK06
Ludek Kucera
Low Degree Connectivity in Ad-Hoc Networks.
203-214
2005
conf/esa/2005
ESA
https://doi.org/10.1007/11561071_20
db/conf/esa/esa2005.html#Kucera05
Ludek Kucera
Graph-Theoretic Concepts in Computer Science, 28th International Workshop, WG 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised Papers
WG
Lecture Notes in Computer Science
2573
Springer
2002
3-540-00331-2
https://doi.org/10.1007/3-540-36379-3
db/conf/wg/wg2002.html
Ludek Kucera
Wait-Free Deflection Routing of Long Messages.
476-488
2001
12
IEEE Trans. Parallel Distributed Syst.
5
https://doi.org/10.1109/71.926169
http://doi.ieeecomputersociety.org/10.1109/71.926169
db/journals/tpds/tpds12.html#Kucera01
Rudolf Fleischer
Ludek Kucera
Algorithm Animation for Teaching.
113-128
2001
conf/dagstuhl/2001svis
Software Visualization
https://doi.org/10.1007/3-540-45875-1_9
db/conf/dagstuhl/svis2001.html#FleischerK01
Ludek Kucera
Computing OR on a Randomized Fixed Adversary CRCW PRAM.
165-166
1997
63
Inf. Process. Lett.
3
db/journals/ipl/ipl63.html#Kucera97
https://doi.org/10.1016/S0020-0190(97)00102-6
Ludek Kucera
Bounds to the Throughput of an Interconnection Network.
139-148
1997
conf/spaa/1997
SPAA
https://doi.org/10.1145/258492.258506
db/conf/spaa/spaa97.html#Kucera97
Ludek Kucera
Expected Complexity of Graph Partitioning Problems.
193-212
1995
57
Discret. Appl. Math.
2-3
https://doi.org/10.1016/0166-218X(94)00103-K
https://www.wikidata.org/entity/Q57568010
db/journals/dam/dam57.html#Kucera95
On Learning Monotone DNF Formulae under Uniform Distributions
Ludek Kucera
Alberto Marchetti-Spaccamela
Marco Protasi
84-95
Inf. Comput.
April
1994
110
1
db/journals/iandc/iandc110.html#KuceraMP94
https://doi.org/10.1006/inco.1994.1024
Andrea Clemnti
José Rolim
Ludek Kucera
A Note on Parallel Randomized Algorithms for Searching Problems.
33-43
1994
Parallel Processing of Discrete Optimization Problems
conf/dimacs/dimacs22
db/conf/dimacs/dimacs22.html#ClemntiRK94
https://doi.org/10.1090/dimacs/022/02
Ludek Kucera
Kurt Mehlhorn
B. Preis
Erik Schwarzenecker
Exact Algorithms for a Geometric Packing Problem (Extended Abstract).
317-322
1993
conf/stacs/1993
STACS
db/conf/stacs/stacs93.html#KuceraMPS93
https://doi.org/10.1007/3-540-56503-5_32
Ludek Kucera
Coloring k-Colorable Graphs in Constant Expected Parallel Time.
166-176
1993
conf/wg/1993
WG
db/conf/wg/wg93.html#Kucera93
https://doi.org/10.1007/3-540-57899-4_50
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.
215-222
1992
3
Random Struct. Algorithms
2
db/journals/rsa/rsa3.html#CalkinFK92
https://doi.org/10.1002/rsa.3240030210
https://www.wikidata.org/entity/Q57401593
Michele Flammini
Alberto Marchetti-Spaccamela
Ludek Kucera
Learning DNF Formulae Under Classes of Probability Distributions.
85-92
1992
conf/colt/1992
COLT
https://doi.org/10.1145/130385.130395
db/conf/colt/colt1992.html#FlamminiMK92
Ludek Kucera
The Greedy Coloring Is a Bad Probabilistic Algorithm.
674-684
1991
12
J. Algorithms
4
db/journals/jal/jal12.html#Kucera91
https://doi.org/10.1016/0196-6774(91)90040-6
Ludek Kucera
A Generalized Encryption Scheme Based on Random Graphs.
180-186
1991
conf/wg/1991
WG
db/conf/wg/wg91.html#Kucera91
https://doi.org/10.1007/3-540-55121-2_17
Ludek Kucera
Graphs with Small Chromatic Numbers are Easy to Color.
233-236
1989
30
Inf. Process. Lett.
5
db/journals/ipl/ipl30.html#Kucera89
https://doi.org/10.1016/0020-0190(89)90200-7
Ludek Kucera
Vera Trnková
Isomorphism Testing of Unary Algebras.
673-686
1988
17
SIAM J. Comput.
4
db/journals/siamcomp/siamcomp17.html#KuceraT88
https://doi.org/10.1137/0217043
Ludek Kucera
Alberto Marchetti-Spaccamela
Marco Protasi
On the Learnability of DNF Formulae.
347-361
1988
conf/icalp/1988
ICALP
db/conf/icalp/icalp88.html#KuceraMP88
https://doi.org/10.1007/3-540-19488-6_127
Canonical Labeling of Regular Graphs in Linear Average Time
Ludek Kucera
271-279
conf/focs/FOCS28
1987
FOCS
db/conf/focs/focs87.html#Kucera87
https://doi.org/10.1109/SFCS.1987.11
https://doi.ieeecomputersociety.org/10.1109/SFCS.1987.11
Ludek Kucera
Alberto Marchetti-Spaccamela
Marco Protasi
Maurizio Talamo
Near Optimal Algorithms for Finding Minimum Steiner Trees on Random Graphs.
501-511
1986
conf/mfcs/1986
MFCS
db/conf/mfcs/mfcs86.html#KuceraMPT86
https://doi.org/10.1007/BFb0016276
Ludek Kucera
An O(N^(1.5+epsilon)) Expected Time Algorithm for Canonization and Isomorphism Testing of Trivalent Garphs.
197-207
1985
conf/stacs/1985
STACS
db/conf/stacs/stacs85.html#Kucera85
https://doi.org/10.1007/BFb0024009
Ludek Kucera
Finding a Maximum Flow in /S, T/-Planar Network in Linear Expected Time.
370-377
1984
conf/mfcs/1984
MFCS
db/conf/mfcs/mfcs84.html#Kucera84
https://doi.org/10.1007/BFb0030319
Ludek Kucera
Parallel Computation and Conflicts in Memory Access.
93-96
1982
14
Inf. Process. Lett.
2
db/journals/ipl/ipl14.html#Kucera82
https://doi.org/10.1016/0020-0190(82)90093-X
Erratum and Addendum: IPL 17(2): 107 (1983)
Ludek Kucera
Vera Trnková
Isomorphism Completeness for Some Algebraic Structures.
218-225
1981
conf/fct/1981
FCT
db/conf/fct/fct81.html#KuceraT81
https://doi.org/10.1007/3-540-10854-8_24
Ludek Kucera
Maximum Flow in Planar Networks.
418-422
1981
conf/mfcs/1981
MFCS
db/conf/mfcs/mfcs81.html#Kucera81
https://doi.org/10.1007/3-540-10856-4_109
Ludek Kucera
Jaroslav Nesetril
Ales Pultr
Complexity of Dimension Three and Some Related Edge-Covering Characteristics of Graphs.
93-106
1980
11
Theor. Comput. Sci.
db/journals/tcs/tcs11.html#KuceraNP80
https://doi.org/10.1016/0304-3975(80)90039-0
Canonical Labelling of Graphs in Linear Average Time
László Babai
Ludek Kucera
39-46
conf/focs/FOCS20
1979
FOCS
db/conf/focs/focs79.html#BabaiK79
https://doi.org/10.1109/SFCS.1979.8
https://doi.ieeecomputersociety.org/10.1109/SFCS.1979.8
Ludek Kucera
Expected Behavior of Graph Coloring Algorithms.
447-451
1977
conf/fct/1977
FCT
db/conf/fct/fct77.html#Kucera77
https://doi.org/10.1007/3-540-08442-8_114
László Babai
Neil J. Calkin
Andrea Clemnti
Michele Flammini
Rudolf Fleischer
Ian T. Foster
Alan M. Frieze
Gerhard R. Joubert
Antonín Kucera 0001
Stepán Kucera
Alberto Marchetti-Spaccamela
Kurt Mehlhorn
Wolfgang E. Nagel
Jaroslav Nesetril
Frans J. Peters
B. Preis
Marco Protasi
Ales Pultr
José Rolim
Erik Schwarzenecker
Maurizio Talamo
Vera Trnková
Bing Zhang 0002