The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Tomasz Luczak: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Paul Fischer, Klaus-Uwe Höffgen, Hanno Lefmann, Tomasz Luczak
    Approximations with Axis-Aligned Rectangles (Extended Abstract). [Citation Graph (1, 0)][DBLP]
    FCT, 1993, pp:244-255 [Conf]
  2. Tomasz Luczak, Wojciech Szpankowski
    A Lossy Data Compression Based on String Matching: Preliminary Analysis and Suboptimal Algorithms. [Citation Graph (0, 0)][DBLP]
    CPM, 1994, pp:102-112 [Conf]
  3. Marcin Gogolewski, Miroslaw Kutylowski, Tomasz Luczak
    Mobile Mixing. [Citation Graph (0, 0)][DBLP]
    ICISC, 2004, pp:380-393 [Conf]
  4. Malgorzata Bednarska, Tomasz Luczak
    Biased Positional Games for Which Random Strategies are Nearly Optimal. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2000, v:20, n:4, pp:477-488 [Journal]
  5. Penny E. Haxell, Yoshiharu Kohayakawa, Tomasz Luczak
    Turán's Extremal Problem in Random Graphs: Forbidding ODD Cycles. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1996, v:16, n:1, pp:107-122 [Journal]
  6. Penny E. Haxell, Tomasz Luczak, P. W. Tingley
    Ramsey Numbers for Trees of Small Maximum Degree. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2002, v:22, n:2, pp:287-320 [Journal]
  7. Yoshiharu Kohayakawa, Tomasz Luczak, Vojtech Rödl
    On K4-Free Subgraphs of Random Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1997, v:17, n:2, pp:173-213 [Journal]
  8. Tomasz Luczak
    On The Structure Of Triangle-Free Graphs Of Large Minimum Degree. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2006, v:26, n:4, pp:489-493 [Journal]
  9. Tomasz Luczak
    The chromatic number of random graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1991, v:11, n:1, pp:45-54 [Journal]
  10. Tomasz Luczak
    A note on the sharp concentration of the chromatic number of random graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1991, v:11, n:3, pp:295-297 [Journal]
  11. Tomasz Luczak, John C. Wierman
    The chromatic number of random graphs at the double jump threshold. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1989, v:9, n:1, pp:39-49 [Journal]
  12. Tomasz Luczak
    On Ramsey Minimal Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1994, v:1, n:, pp:- [Journal]
  13. Dwight Duffus, Tomasz Luczak, Vojtech Rödl, Andrzej Rucinski
    Endomorphisms of Partially Ordered Sets. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:1, pp:33-46 [Journal]
  14. Paul Erdös, András Gyárfás, Tomasz Luczak
    Independet Transversals in Sparse Partite Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:293-296 [Journal]
  15. Penny E. Haxell, Yoshiharu Kohayakawa, Tomasz Luczak
    The Induced Size-Ramsey Number of Cycles. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1995, v:4, n:, pp:217-239 [Journal]
  16. Jerzy Jaworski, Tomasz Luczak
    Cycles in a Uniform Graph Process. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:223-239 [Journal]
  17. Tomasz Luczak, Boris Pittel
    Componenets of Random Forests. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:35-52 [Journal]
  18. Tomasz Luczak, László Pyber
    On Random Generation of the Symmetic Group. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:505-512 [Journal]
  19. Tomasz Luczak, Vojtech Rödl, Endre Szemerédi
    Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:4, pp:423-436 [Journal]
  20. Izolda Gorgol, Tomasz Luczak
    On induced Ramsey numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:251, n:1-3, pp:87-96 [Journal]
  21. Penny E. Haxell, Tomasz Luczak
    Embedding trees into graphs of large girth. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:216, n:1-3, pp:273-278 [Journal]
  22. Tomasz Luczak, Andrzej Rucinski, Sebastian Urbanski
    On minimal Folkman graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:245-262 [Journal]
  23. Tomasz Luczak, Tomasz Schoen
    Sum-Free Subsets of Right Cancellative Semigroups. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2001, v:22, n:7, pp:999-1002 [Journal]
  24. Tomasz Luczak, Jaroslav Nesetril
    When is a random graph projective? [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:7, pp:1147-1154 [Journal]
  25. Tomasz Luczak, Edyta Szymanska
    A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:25, n:2, pp:311-320 [Journal]
  26. Alan M. Frieze, Tomasz Luczak
    On the independence and chromatic numbers of random regular graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:54, n:1, pp:123-132 [Journal]
  27. Ronald L. Graham, Tomasz Luczak, Vojtech Rödl, Andrzej Rucinski
    Ramsey Properties of Families of Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:86, n:2, pp:413-419 [Journal]
  28. Penny E. Haxell, Yoshiharu Kohayakawa, Tomasz Luczak
    Turán's Extremal Problem in Random Graphs: Forbidding Even Cycles. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1995, v:64, n:2, pp:273-287 [Journal]
  29. Penny E. Haxell, Tomasz Luczak, Yuejian Peng, Vojtech Rödl, Andrzej Rucinski, Miklós Simonovits, Jozef Skokan
    The Ramsey number for hypergraph cycles I. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2006, v:113, n:1, pp:67-83 [Journal]
  30. Yoshiharu Kohayakawa, Tomasz Luczak
    Sparse Anti-Ramsey Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1995, v:63, n:1, pp:146-152 [Journal]
  31. Tomasz Luczak
    A Note on the Density of Sum-free Sets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1995, v:70, n:2, pp:334-336 [Journal]
  32. Tomasz Luczak
    R(Cn, Cn, Cn)<=(4+o(1)) n. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1999, v:75, n:2, pp:174-187 [Journal]
  33. Tomasz Luczak, Vojtech Rödl
    On Induced Ramsey Numbers for Graphs with Bounded Maximum Degree. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:66, n:2, pp:324-333 [Journal]
  34. Tomasz Luczak, Andrzej Rucinski, Sebastian Urbanski
    Vertex Ramsey Properties of Families of Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:84, n:2, pp:240-248 [Journal]
  35. Tomasz Luczak, Andrzej Rucinski, Bernd Voigt
    Ramsey properties of random graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1992, v:56, n:1, pp:55-68 [Journal]
  36. Tomasz Luczak, Eric Vigoda
    Torpid mixing of the Wang-Swendsen-Kotecký algorithm for sampling colorings. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2005, v:3, n:1, pp:92-100 [Journal]
  37. Noga Alon, Benjamin Doerr, Tomasz Luczak, Tomasz Schoen
    On the discrepancy of combinatorial rectangles. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2002, v:21, n:3-4, pp:205-215 [Journal]
  38. Béla Bollobás, Yoshiharu Kohayakawa, Tomasz Luczak
    The Evaluation of Random Subgraphs of the Cube. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1992, v:3, n:1, pp:55-90 [Journal]
  39. Béla Bollobás, Yoshiharu Kohayakawa, Tomasz Luczak
    On the Diameter and Radius of Random Subgraphs of the Cube. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1994, v:5, n:5, pp:627-648 [Journal]
  40. Béla Bollobás, Yoshiharu Kohayakawa, Tomasz Luczak
    Connectivity Properties of Random Subgraphs of the Cube. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:6, n:2/3, pp:221-230 [Journal]
  41. Malgorzata Bednarska, Tomasz Luczak
    Biased positional games and the phase transition. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2001, v:18, n:2, pp:141-152 [Journal]
  42. Paul Erdös, Tomasz Luczak
    Change of Leadership in a Random Graph Process. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1994, v:5, n:1, pp:243-252 [Journal]
  43. Alan M. Frieze, Svante Janson, Tomasz Luczak
    Introduction. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1994, v:5, n:1, pp:1-3 [Journal]
  44. Svante Janson, Donald E. Knuth, Tomasz Luczak, Boris Pittel
    The Birth of the Giant Component. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1993, v:4, n:3, pp:233-359 [Journal]
  45. Mihyun Kang, Youngmee Koh, Sangwook Ree, Tomasz Luczak
    The connectivity threshold for the min-degree random graph process. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2006, v:29, n:1, pp:105-120 [Journal]
  46. Tomasz Luczak
    On triangle-free random graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2000, v:16, n:3, pp:260-276 [Journal]
  47. Tomasz Luczak
    On the Number of Sparse Connected Graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1990, v:1, n:2, pp:171-174 [Journal]
  48. Tomasz Luczak
    Component Behavior Near the Critical Point of the Random Graph Process. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1990, v:1, n:3, pp:287-310 [Journal]
  49. Tomasz Luczak
    Cycles in a Random Graph Near the Critical Point. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1991, v:2, n:4, pp:421-441 [Journal]
  50. Tomasz Luczak
    Random trees and random graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:13, n:3-4, pp:485-500 [Journal]
  51. Tomasz Luczak, Joel E. Cohen
    Stability of Vertices in Random Boolean Cellular Automata. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1991, v:2, n:3, pp:327-334 [Journal]
  52. Malwina J. Luczak, Tomasz Luczak
    The phase transition in the cluster-scaled model of a random graph. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2006, v:28, n:2, pp:215-246 [Journal]
  53. Tomasz Luczak, Saharon Shelah
    Convergence in Homogeneous Random Graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:6, n:4, pp:371-393 [Journal]
  54. Tomasz Luczak, Lubos Thoma
    Convergence of probabilities for the second order monadic properties of a random mapping. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1997, v:11, n:3, pp:277-295 [Journal]
  55. Tomasz Luczak, Jaroslav Nesetril
    A Probabilistic Approach to the Dichotomy Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:3, pp:835-843 [Journal]
  56. Tomasz Luczak
    A Greedy Algorithm Estimating the Height of Random Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1998, v:11, n:2, pp:318-329 [Journal]
  57. Tomasz Luczak, Andrzej Rucinski
    Tree-Matchings in Graph Processes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:1, pp:107-120 [Journal]
  58. Tomasz Luczak, Wojciech Szpankowski
    A suboptimal lossy data compression based on approximate pattern matching. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:5, pp:1439-1451 [Journal]
  59. Tomasz Luczak, Wojciech Szpankowski
    Correction to 'A Suboptimal Lossy Data Compression Based on Approximate Pattern Matching'. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:6, pp:2064-2065 [Journal]
  60. Tomasz Luczak, Jaroslav Nesetril
    Note on projective graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:47, n:2, pp:81-86 [Journal]
  61. Ronald J. Gould, Tomasz Luczak, Florian Pfender
    Pancyclicity of 3-connected graphs: Pairs of forbidden subgraphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:47, n:3, pp:183-202 [Journal]
  62. Tomasz Luczak, Florian Pfender
    Claw-free 3-connected P11-free graphs are hamiltonian. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:47, n:2, pp:111-121 [Journal]
  63. Tomasz Luczak, Zbigniew Palka
    Maximal induced trees in sparse random graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:257-265 [Journal]
  64. Wojciech Kordecki, Tomasz Luczak
    On the connectivity of random subsets of projective spaces. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:196, n:1-3, pp:207-217 [Journal]
  65. Tomasz Luczak, Vojtech Rödl, Tomasz Schoen
    Independent finite sums in graphs defined on the natural numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:181, n:1-3, pp:289-294 [Journal]
  66. Michal Karonski, Tomasz Luczak
    The number of connected sparsely edged uniform hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:171, n:1-3, pp:153-167 [Journal]
  67. Ervin Györi, Alexandr V. Kostochka, Tomasz Luczak
    Graphs without short odd cycles are nearly bipartite. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:163, n:1-3, pp:279-284 [Journal]
  68. Tomasz Luczak
    Size and connectivity of the k-core of a random graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:91, n:1, pp:61-68 [Journal]
  69. Tomasz Luczak
    Cycles in random graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:98, n:3, pp:231-236 [Journal]
  70. Tomasz Luczak
    The size of the largest hole in a random graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:112, n:1-3, pp:151-163 [Journal]
  71. Tomasz Luczak, Andrzej Rucinski, Jacek Gruszka
    On the evolution of a random tournament. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:148, n:1-3, pp:311-316 [Journal]
  72. Paul Erdös, András Gyárfás, Tomasz Luczak
    Graphs in which each C4 spans K4. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:154, n:1-3, pp:263-268 [Journal]
  73. D. Frank Hsu, Tomasz Luczak
    On the k-diameter of k-regular k-connected graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:133, n:1-3, pp:291-296 [Journal]
  74. Tomasz Luczak
    Phase transition phenomena in random discrete structures. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:136, n:1-3, pp:225-242 [Journal]
  75. Agnieszka Figaj, Tomasz Luczak
    The Ramsey number for a triple of long even cycles. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2007, v:97, n:4, pp:584-596 [Journal]

  76. Self-stabilizing population of mobile agents. [Citation Graph (, )][DBLP]


  77. Constructive Upper Bounds for Cycle-Saturated Graphs of Minimum Size. [Citation Graph (, )][DBLP]


  78. First-Order Definability of Trees and Sparse Random Graphs. [Citation Graph (, )][DBLP]


  79. The Ramsey Number for 3-Uniform Tight Hypergraph Cycles. [Citation Graph (, )][DBLP]


  80. Holes in random graphs. [Citation Graph (, )][DBLP]


  81. On the minimum degree forcing F-free graphs to be (nearly) bipartite. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.010secs
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