The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ludek Kucera: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ludek Kucera, Stepán Kucera
    Wireless Communication in Random Geometric Topologies. [Citation Graph (0, 0)][DBLP]
    ALGOSENSORS, 2006, pp:107-118 [Conf]
  2. Michele Flammini, Alberto Marchetti-Spaccamela, Ludek Kucera
    Learning DNF Formulae Under Classes of Probability Distributions. [Citation Graph (0, 0)][DBLP]
    COLT, 1992, pp:85-92 [Conf]
  3. Rudolf Fleischer, Ludek Kucera
    Algorithm Animation for Teaching. [Citation Graph (0, 0)][DBLP]
    Software Visualization, 2001, pp:113-128 [Conf]
  4. Ludek Kucera
    Low Degree Connectivity in Ad-Hoc Networks. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:203-214 [Conf]
  5. Ludek Kucera
    Expected Behavior of Graph Coloring Algorithms. [Citation Graph (0, 0)][DBLP]
    FCT, 1977, pp:447-451 [Conf]
  6. Ludek Kucera, Vera Trnková
    Isomorphism Completeness for Some Algebraic Structures. [Citation Graph (0, 0)][DBLP]
    FCT, 1981, pp:218-225 [Conf]
  7. László Babai, Ludek Kucera
    Canonical Labelling of Graphs in Linear Average Time [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:39-46 [Conf]
  8. Ludek Kucera
    Canonical Labeling of Regular Graphs in Linear Average Time [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:271-279 [Conf]
  9. Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi
    On the Learnability of DNF Formulae. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:347-361 [Conf]
  10. Ludek Kucera
    Maximum Flow in Planar Networks. [Citation Graph (0, 0)][DBLP]
    MFCS, 1981, pp:418-422 [Conf]
  11. Ludek Kucera
    Finding a Maximum Flow in /S, T/-Planar Network in Linear Expected Time. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:370-377 [Conf]
  12. Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi, Maurizio Talamo
    Near Optimal Algorithms for Finding Minimum Steiner Trees on Random Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1986, pp:501-511 [Conf]
  13. Ludek Kucera
    Bounds to the Throughput of an Interconnection Network. [Citation Graph (0, 0)][DBLP]
    SPAA, 1997, pp:139-148 [Conf]
  14. Ludek Kucera
    An O(N^(1.5+epsilon)) Expected Time Algorithm for Canonization and Isomorphism Testing of Trivalent Garphs. [Citation Graph (0, 0)][DBLP]
    STACS, 1985, pp:197-207 [Conf]
  15. Ludek Kucera, Kurt Mehlhorn, B. Preis, E. Schwarzenecker
    Exact Algorithms for a Geometric Packing Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:317-322 [Conf]
  16. Ludek Kucera
    A Generalized Encryption Scheme Based on Random Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1991, pp:180-186 [Conf]
  17. Ludek Kucera
    Coloring k-Colorable Graphs in Constant Expected Parallel Time. [Citation Graph (0, 0)][DBLP]
    WG, 1993, pp:166-176 [Conf]
  18. Ludek Kucera
    Expected Complexity of Graph Partitioning Problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:57, n:2-3, pp:193-212 [Journal]
  19. Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi
    On Learning Monotone DNF Formulae under Uniform Distributions [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:110, n:1, pp:84-95 [Journal]
  20. Ludek Kucera
    Parallel Computation and Conflicts in Memory Access. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1982, v:14, n:2, pp:93-96 [Journal]
  21. Ludek Kucera
    Graphs with Small Chromatic Numbers are Easy to Color. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:30, n:5, pp:233-236 [Journal]
  22. Ludek Kucera
    Computing OR on a Randomized Fixed Adversary CRCW PRAM. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:63, n:3, pp:165-166 [Journal]
  23. Ludek Kucera
    The Greedy Coloring Is a Bad Probabilistic Algorithm. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1991, v:12, n:4, pp:674-684 [Journal]
  24. 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. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1992, v:3, n:2, pp:215-222 [Journal]
  25. Ludek Kucera, Vera Trnková
    Isomorphism Testing of Unary Algebras. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:4, pp:673-686 [Journal]
  26. Ludek Kucera, Jaroslav Nesetril, Ales Pultr
    Complexity of Dimension Three and Some Related Edge-Covering Characteristics of Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:11, n:, pp:93-106 [Journal]
  27. Ludek Kucera
    Wait-Free Deflection Routing of Long Messages. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2001, v:12, n:5, pp:476-488 [Journal]

  28. Optimum Allocation of Energy and Spectrum in Power-Controlled Wireless Networks with QoS Constraints. [Citation Graph (, )][DBLP]


  29. How to Visualise Abstract Topics in Computer and Communication Science. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002