default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLudek Kucera
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c25]Ludek Kucera:
Algovision - An Algorithm Visualization Tool. SIGCSE (2) 2024: 1925- 2023
- [c24]Ludek Kucera
:
Teaching Advanced Algorithms in an Undergraduate CS Course: a CGM Case Study. SIGCSE (2) 2023: 1404 - 2020
- [c23]Ludek Kucera:
Cognitive and Social Aspects of Visualization in Algorithm Learning. CSEDU (2) 2020: 270-277 - [e3]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. Advances in Parallel Computing 36, IOS Press 2020, ISBN 978-1-64368-070-5 [contents]
2010 – 2019
- 2018
- [c22]Ludek Kucera:
Visualization of Abstract Algorithmic Ideas. CSEDU (1) 2018: 497-504 - 2017
- [c21]Ludek Kucera:
On Architecture for the Future Petascale Computing. PARCO 2017: 211-220 - 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]Ludek Kucera:
Foreword. Theor. Comput. Sci. 410(50): 5201 (2009) - [c20]Ludek Kucera:
How to Visualise Abstract Topics in Computer and Communication Science. CSEDU (2) 2009: 313-317 - [c19]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:
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 [contents] - 2006
- [c18]Ludek Kucera, Stepán Kucera:
Wireless Communication in Random Geometric Topologies. ALGOSENSORS 2006: 107-118 - 2005
- [c17]Ludek Kucera:
Low Degree Connectivity in Ad-Hoc Networks. ESA 2005: 203-214 - 2002
- [e1]Ludek Kucera:
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 [contents] - 2001
- [j10]Ludek Kucera:
Wait-Free Deflection Routing of Long Messages. IEEE Trans. Parallel Distributed Syst. 12(5): 476-488 (2001) - [c16]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) - [c15]Ludek Kucera:
Bounds to the Throughput of an Interconnection Network. SPAA 1997: 139-148 - 1995
- [j8]Ludek Kucera:
Expected Complexity of Graph Partitioning Problems. Discret. Appl. Math. 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) - [c14]Andrea Clemnti, José Rolim, Ludek Kucera:
A Note on Parallel Randomized Algorithms for Searching Problems. Parallel Processing of Discrete Optimization Problems 1994: 33-43 - 1993
- [c13]Ludek Kucera, Kurt Mehlhorn, B. Preis, Erik Schwarzenecker:
Exact Algorithms for a Geometric Packing Problem (Extended Abstract). STACS 1993: 317-322 - [c12]Ludek Kucera:
Coloring k-Colorable Graphs in Constant Expected Parallel Time. WG 1993: 166-176 - 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]Ludek Kucera:
A Generalized Encryption Scheme Based on Random Graphs. WG 1991: 180-186
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]Ludek Kucera:
Canonical Labeling of Regular Graphs in Linear Average Time. FOCS 1987: 271-279 - 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]Ludek Kucera:
Maximum Flow in Planar Networks. MFCS 1981: 418-422 - 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]László Babai, Ludek Kucera:
Canonical Labelling of Graphs in Linear Average Time. FOCS 1979: 39-46 - 1977
- [c1]Ludek Kucera:
Expected Behavior of Graph Coloring Algorithms. FCT 1977: 447-451
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
