The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andrzej Rucinski: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Andrzej Rucinski, Barbara Dziurla-Rucinska
    Boundary Scan as a Test Solution in Microelectronics Curricula. [Citation Graph (0, 0)][DBLP]
    DELTA, 2002, pp:214-218 [Conf]
  2. Andrzej Rucinski, Artur Skrygulec, Khrystyna Pysareva, Jakub Mocny
    Microsystem Development Using the TQM Design Methodology. [Citation Graph (0, 0)][DBLP]
    DELTA, 2004, pp:225-230 [Conf]
  3. Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
    Universality and Tolerance. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:14-21 [Conf]
  4. Andrzej Rucinski, John L. Pokoski
    Polystructural, Reconfigurable, and Fault-Tolerant Computers. [Citation Graph (0, 0)][DBLP]
    ICDCS, 1986, pp:175-182 [Conf]
  5. Endre Szemerédi, Andrzej Rucinski, Vojtech Rödl
    The Generalization of Dirac's Theorem for Hypergraphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:52-56 [Conf]
  6. Pawel Nowakowski, Barbara Dziurla-Rucinska, Andrzej Rucinski
    VLSI Design and Test Sequence in an Academic Environment: A Case Study. [Citation Graph (0, 0)][DBLP]
    MSE, 1999, pp:22-23 [Conf]
  7. Andrzej Rucinski, Barrett Stetson, S. T. P. Brundavani
    A DOT1 & DOT4 MOSIS - Compatible Library. [Citation Graph (0, 0)][DBLP]
    MSE, 2003, pp:83-84 [Conf]
  8. Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
    Near-optimum Universal Graphs for Graphs with Bounded Degrees. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:170-180 [Conf]
  9. Vojtech Rödl, Andrzej Rucinski, Michelle Wagner
    An Algorithmic Embedding of Graphs via Perfect Matchings. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1998, pp:25-34 [Conf]
  10. Andrzej Rucinski, Frank Hludik, John L. Pokoski
    A partnership in domestication of rapid prototyping technologies. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 1990, pp:1-5 [Conf]
  11. Nicholas Ilyadis, Peter Drexel, Andrzej Rucinski
    The simulation of the non-linear dynamic behavior of distributed routing networks using DECSIM. [Citation Graph (0, 0)][DBLP]
    Winter Simulation Conference, 1991, pp:705-715 [Conf]
  12. Ronald L. Graham, Vojtech Rödl, Andrzej Rucinski
    On Bipartite Graphs with Linear Ramsey Numbers. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2001, v:21, n:2, pp:199-209 [Journal]
  13. Svante Janson, Andrzej Rucinski
    The Deletion Method For Upper Tail Estimates. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:24, n:4, pp:615-640 [Journal]
  14. Andrzej Rucinski, Andrew Vince
    Balanced extensions of graphs and hypergraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1988, v:8, n:3, pp:279-291 [Journal]
  15. Vojtech Rödl, Andrzej Rucinski
    Perfect Matchings in <epsilon>-Regular Graphs and the Blow-Up Lemma. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1999, v:19, n:3, pp:437-452 [Journal]
  16. Noga Alon, Vojtech Rödl, Andrzej Rucinski
    Perfect Matchings in $\epsilon$-regular Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1998, v:5, n:, pp:- [Journal]
  17. Yuejian Peng, Vojtech Rödl, Andrzej Rucinski
    Holes in Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2002, v:9, n:1, pp:- [Journal]
  18. 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]
  19. Ehud Friedgut, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Prasad Tetali
    Ramsey Games Against a One-Armed Bandit. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2003, v:12, n:5-6, pp:515-545 [Journal]
  20. Catherine S. Greenhill, Andrzej Rucinski, Nicholas C. Wormald
    Connectedness Of The Degree Bounded Star Process. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2003, v:12, n:3, pp:- [Journal]
  21. Vojtech Rödl, Andrzej Rucinski
    Bipartite Coverings of Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1997, v:6, n:3, pp:349-352 [Journal]
  22. Vojtech Rödl, Andrzej Rucinski, Anusch Taraz
    Hypergraph Packing And Graph Embedding. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1999, v:8, n:4, pp:- [Journal]
  23. Andrzej Rucinski, Nicholas C. Wormald
    Random Graph Processes with Degree Restrictions. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:169-180 [Journal]
  24. Justyna Kurkowiak, Andrzej Rucinski
    Solitary subgraphs of random graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:213, n:1-3, pp:195-209 [Journal]
  25. 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]
  26. Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
    Perfect matchings in uniform hypergraphs with large minimum degree. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:8, pp:1333-1349 [Journal]
  27. Catherine S. Greenhill, Andrzej Rucinski, Nicholas C. Wormald
    Random Hypergraph Processes with Degree Restrictions. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:3, pp:319-332 [Journal]
  28. Andrew D. Barbour, Michal Karonski, Andrzej Rucinski
    A central limit theorem for decomposable random variables with applications to random graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1989, v:47, n:2, pp:125-145 [Journal]
  29. 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]
  30. 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]
  31. 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]
  32. 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]
  33. Vojtech Rödl, Andrzej Rucinski
    Ramsey Properties of Random Hypergraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1998, v:81, n:1, pp:1-33 [Journal]
  34. Joanna Polcyn, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
    Short paths in quasi-random triple systems with sparse underlying graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:4, pp:584-607 [Journal]
  35. Andrew D. Barbour, Svante Janson, Michal Karonski, Andrzej Rucinski
    Small Cliques in Random Graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1990, v:1, n:4, pp:403-434 [Journal]
  36. Svante Janson, Andrzej Rucinski
    The infamous upper tail. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2002, v:20, n:3, pp:317-342 [Journal]
  37. Vojtech Rödl, Andrzej Rucinski
    Random Graphs with Monochromatic Triangles in Every Edge Coloring. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1994, v:5, n:2, pp:253-270 [Journal]
  38. Vojtech Rödl, Andrzej Rucinski, Michelle Wagner
    Matchings Meeting Quotas and Their Impact on the Blow-Up Lemma. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:2, pp:428-446 [Journal]
  39. 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]
  40. Zbigniew Palka, Andrzej Rucinski, Joel Spencer
    On a method for random graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:253-258 [Journal]
  41. Andrzej Rucinski
    The behaviour of (k, ..., kn, n-ik)ci/i! is asymptotically normal. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:49, n:3, pp:287-290 [Journal]
  42. Andrzej Rucinski, Miroslaw Truszczynski
    A note on local colorings of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:251-255 [Journal]
  43. Andrzej Rucinski
    Matching and covering the vertices of a random graph by copies of a given graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:105, n:1-3, pp:185-197 [Journal]
  44. 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]

  45. The Complexity of Perfect Matching Problems on Dense Hypergraphs. [Citation Graph (, )][DBLP]


  46. Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs. [Citation Graph (, )][DBLP]


  47. Universality of random graphs. [Citation Graph (, )][DBLP]


  48. An approximate Dirac-type theorem for k -uniform hypergraphs. [Citation Graph (, )][DBLP]


  49. Neighbour-Distinguishing Edge Colourings of Random Regular Graphs. [Citation Graph (, )][DBLP]


  50. A Dirac-Type Theorem for 3-Uniform Hypergraphs. [Citation Graph (, )][DBLP]


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


  52. Planar Ramsey numbers for cycles. [Citation Graph (, )][DBLP]


  53. Short paths in epsilon-regular pairs and small diameter decompositions of dense graphs. [Citation Graph (, )][DBLP]


Search in 0.231secs, Finished in 0.232secs
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