Ludek Kucera

Orcid: 0000-0002-5718-6120

According to our database1, Ludek Kucera authored at least 37 papers between 1977 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Algovision - An Algorithm Visualization Tool.
Proceedings of the 55th ACM Technical Symposium on Computer Science Education, 2024

2023
Teaching Advanced Algorithms in an Undergraduate CS Course: a CGM Case Study.
Proceedings of the 54th ACM Technical Symposium on Computer Science Education, Volume 2, 2023

2020
Cognitive and Social Aspects of Visualization in Algorithm Learning.
Proceedings of the 12th International Conference on Computer Supported Education, 2020

2018
Visualization of Abstract Algorithmic Ideas.
Proceedings of the 10th International Conference on Computer Supported Education, 2018

2017
On Architecture for the Future Petascale Computing.
Proceedings of the Parallel Computing is Everywhere, 2017

2012
Efficient Distributed Algorithms for Dynamic Access to Shared Multiuser Channels in SINR-Constrained Wireless Networks.
IEEE Trans. Mob. Comput., 2012

2009
Foreword.
Theor. Comput. Sci., 2009

Optimum Allocation of Energy and Spectrum in Power-Controlled Wireless Networks with QoS Constraints.
Proceedings of the Global Communications Conference, 2009. GLOBECOM 2009, Honolulu, Hawaii, USA, 30 November, 2009

How to Visualise Abstract Topics in Computer and Communication Science.
Proceedings of the CSEDU 2009 - Proceedings of the First International Conference on Computer Supported Education, Lisboa, Portugal, March 23-26, 2009, 2009

2006
Wireless Communication in Random Geometric Topologies.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2006

2005
Low Degree Connectivity in Ad-Hoc Networks.
Proceedings of the Algorithms, 2005

2001
Wait-Free Deflection Routing of Long Messages.
IEEE Trans. Parallel Distributed Syst., 2001

Algorithm Animation for Teaching.
Proceedings of the Software Visualization, 2001

1997
Computing OR on a Randomized Fixed Adversary CRCW PRAM.
Inf. Process. Lett., 1997

Bounds to the Throughput of an Interconnection Network.
Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 1997

1995
Expected Complexity of Graph Partitioning Problems.
Discret. Appl. Math., 1995

1994
On Learning Monotone DNF Formulae under Uniform Distributions
Inf. Comput., April, 1994

A Note on Parallel Randomized Algorithms for Searching Problems.
Proceedings of the Workshop on Parallel Processing of Discrete Optimization Problems, 1994

1993
Coloring k-Colorable Graphs in Constant Expected Parallel Time.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

Exact Algorithms for a Geometric Packing Problem (Extended Abstract).
Proceedings of the STACS 93, 1993

1992
On the Expected Performance of a Parallel Algorithm for Finding Maximal Independent Subsets of a Random Graph.
Random Struct. Algorithms, 1992

Learning DNF Formulae Under Classes of Probability Distributions.
Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

1991
The Greedy Coloring Is a Bad Probabilistic Algorithm.
J. Algorithms, 1991

A Generalized Encryption Scheme Based on Random Graphs.
Proceedings of the 17th International Workshop, 1991

1989
Graphs with Small Chromatic Numbers are Easy to Color.
Inf. Process. Lett., 1989

1988
Isomorphism Testing of Unary Algebras.
SIAM J. Comput., 1988

On the Learnability of DNF Formulae.
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

1987
Canonical Labeling of Regular Graphs in Linear Average Time
Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1986
Near Optimal Algorithms for Finding Minimum Steiner Trees on Random Graphs.
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

1985
An O(N^(1.5+epsilon)) Expected Time Algorithm for Canonization and Isomorphism Testing of Trivalent Garphs.
Proceedings of the STACS 85, 1985

1984
Finding a Maximum Flow in /S, T/-Planar Network in Linear Expected Time.
Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

1982
Parallel Computation and Conflicts in Memory Access.
Inf. Process. Lett., 1982

1981
Maximum Flow in Planar Networks.
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

Isomorphism Completeness for Some Algebraic Structures.
Proceedings of the Fundamentals of Computation Theory, 1981

1980
Complexity of Dimension Three and Some Related Edge-Covering Characteristics of Graphs.
Theor. Comput. Sci., 1980

1979
Canonical Labelling of Graphs in Linear Average Time
Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

1977
Expected Behavior of Graph Coloring Algorithms.
Proceedings of the Fundamentals of Computation Theory, 1977


  Loading...