The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Artur Czumaj: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Artur Czumaj, Hairong Zhao
    Fault-tolerant geometric spanners. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:1-10 [Conf]
  2. Artur Czumaj, Leszek Gasieniec
    On the Complexity of Determining the Period of a String. [Citation Graph (0, 0)][DBLP]
    CPM, 2000, pp:412-422 [Conf]
  3. André Berger, Artur Czumaj, Michelangelo Grigni, Hairong Zhao
    Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:472-483 [Conf]
  4. Artur Czumaj, Friedhelm Meyer auf der Heide, Volker Stemann
    Shared Memory Simulations with Triple-Logarithmic Delay. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:46-59 [Conf]
  5. Artur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys
    Fast Generation of Random Permutations via Networks Simulation. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:246-260 [Conf]
  6. Artur Czumaj, Christian Sohler
    Property Testing with Geometric Queries. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:266-277 [Conf]
  7. Artur Czumaj, Willy-Bernhard Strothmann
    Bounded Degree Spanning Trees (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1997, pp:104-117 [Conf]
  8. Artur Czumaj, Christian Sohler, Martin Ziegler
    Property Testing in Computational Geometry. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:155-166 [Conf]
  9. Bogdan S. Chlebus, Artur Czumaj, Jop F. Sibeyn
    Routing on the PADAM: Degrees of Optimality. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1997, pp:272-279 [Conf]
  10. Artur Czumaj, Wojciech Rytter
    Broadcasting Algorithms in Radio Networks with Unknown Topology. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:492-501 [Conf]
  11. Artur Czumaj, Christian Sohler
    Abstract Combinatorial Programs and Efficient Property Testers. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:83-92 [Conf]
  12. Artur Czumaj, Volker Stemann
    Randomized Allocation Processes. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:194-203 [Conf]
  13. Mihai Badoiu, Artur Czumaj, Piotr Indyk, Christian Sohler
    Facility Location in Sublinear Time. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:866-877 [Conf]
  14. Artur Czumaj, Alan Gibbons
    Problems on Pairs of Trees and the Four Colour Problem of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:88-101 [Conf]
  15. Artur Czumaj, Andrzej Lingas
    Fast Approximation Schemes for Euclidean Multi-connectivity Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:856-868 [Conf]
  16. Artur Czumaj, Andrzej Lingas
    A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:682-694 [Conf]
  17. Artur Czumaj, Andrzej Lingas, Hairong Zhao
    Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:973-984 [Conf]
  18. Artur Czumaj, Christian Sohler
    Testing Hypergraph Coloring. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:493-505 [Conf]
  19. Artur Czumaj, Christian Sohler
    Sublinear-Time Approximation for Clustering Via Random Sampling. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:396-407 [Conf]
  20. Artur Czumaj, Andrzej Lingas, Johan Nilsson
    Improved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:544-553 [Conf]
  21. Artur Czumaj, Friedhelm Meyer auf der Heide, Volker Stemann
    Improved Optimal Shared Memory Simulations, and the Power of Reconfiguration. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1995, pp:11-19 [Conf]
  22. Bogdan S. Chlebus, Artur Czumaj, Leszek Gasieniec, Miroslaw Kowaluk, Wojciech Plandowski
    Parallel Alternating-Direction Access Machine. [Citation Graph (0, 0)][DBLP]
    MFCS, 1996, pp:267-278 [Conf]
  23. Artur Czumaj, Amir Ronen
    On the expected payment of mechanisms for task allocation. [Citation Graph (0, 0)][DBLP]
    PODC, 2004, pp:98-106 [Conf]
  24. Artur Czumaj, Chris Riley, Christian Scheideler
    Perfectly Balanced Allocation. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2003, pp:240-251 [Conf]
  25. Artur Czumaj, Amir Ronen
    On the expected payment of mechanisms for task allocation: [extended abstract]. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2004, pp:252-253 [Conf]
  26. René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking
    Computing equilibria for congestion games with (im)perfect information. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:746-755 [Conf]
  27. Artur Czumaj, Funda Ergün, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, Christian Sohler
    Sublinear-time approximation of Euclidean minimum spanning tree. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:813-822 [Conf]
  28. Artur Czumaj, Michelangelo Grigni, Papa Sissokho, Hairong Zhao
    Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:496-505 [Conf]
  29. Artur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys
    Delayed Path Coupling and Generating Random Permutations via Distributed Stochastic Processes. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:271-280 [Conf]
  30. Artur Czumaj, Andrzej Lingas
    On Approximability of the Minimum-Cost k-Connected Spanning Subgraph Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:281-290 [Conf]
  31. Artur Czumaj, Christian Scheideler
    Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:30-39 [Conf]
  32. Artur Czumaj, Christian Sohler
    Soft kinetic data structures. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:865-872 [Conf]
  33. Artur Czumaj, Berthold Vöcking
    Tight bounds for worst-case equilibria. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:413-420 [Conf]
  34. Petra Berenbrink, Artur Czumaj, Tom Friedetzky, Nikita D. Vvedenskaya
    Infinite parallel job allocation (extended abstract). [Citation Graph (0, 0)][DBLP]
    SPAA, 2000, pp:99-108 [Conf]
  35. Artur Czumaj
    Recovery Time of Dynamic Allocation Processes. [Citation Graph (0, 0)][DBLP]
    SPAA, 1998, pp:202-211 [Conf]
  36. Maxime Crochemore, Thierry Lecroq, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Wojciech Plandowski, Wojciech Rytter
    Speeding Up Two String-Matching Algorithms. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:589-600 [Conf]
  37. Artur Czumaj
    Parallel Algorithm for the Matrix Chain Product and the Optimal Triangulation Problems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:294-305 [Conf]
  38. Artur Czumaj, Christian Sohler
    Small Space Representations for Metric Min-Sum k -Clustering and Their Applications. [Citation Graph (0, 0)][DBLP]
    STACS, 2007, pp:536-548 [Conf]
  39. Petra Berenbrink, Artur Czumaj, Angelika Steger, Berthold Vöcking
    Balanced allocations: the heavily loaded case. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:745-754 [Conf]
  40. Artur Czumaj, Zvi Galil, Leszek Gasieniec, Kunsoo Park, Wojciech Plandowski
    Work-time-optimal parallel algorithms for string problems. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:713-722 [Conf]
  41. Artur Czumaj, Piotr Krysta, Berthold Vöcking
    Selfish traffic allocation for server farms. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:287-296 [Conf]
  42. Artur Czumaj, Christian Scheideler
    A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:38-47 [Conf]
  43. Artur Czumaj, Christian Sohler
    Estimating the weight of metric minimum spanning trees in sublinear-time. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:175-183 [Conf]
  44. Artur Czumaj
    An Optimal Parallel Algorithm for Computing a Near-Optimal Order of Matrix Multiplications. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:62-72 [Conf]
  45. Artur Czumaj, Leszek Gasieniec, Marek Piotrów, Wojciech Rytter
    Parallel and Sequential Approximations of Shortest Superstrings. [Citation Graph (0, 0)][DBLP]
    SWAT, 1994, pp:95-106 [Conf]
  46. Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito
    Efficient Web Searching Using Temporal Factors. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:294-305 [Conf]
  47. Maxime Crochemore, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
    Speeding Up Two String-Matching Algorithms. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:12, n:4/5, pp:247-267 [Journal]
  48. Artur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys
    Fast Generation of Random Permutations Via Networks Simulation. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:21, n:1, pp:2-20 [Journal]
  49. Artur Czumaj, Hairong Zhao
    Fault-Tolerant Geometric Spanners. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:32, n:2, pp:207-230 [Journal]
  50. Artur Czumaj, Friedhelm Meyer auf der Heide, Volker Stemann
    Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1997, v:137, n:2, pp:103-120 [Journal]
  51. Dany Breslauer, Artur Czumaj, Devdatt P. Dubhashi, Friedhelm Meyer auf der Heide
    Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:62, n:2, pp:103-110 [Journal]
  52. Artur Czumaj, Krzysztof Diks, Teresa M. Przytycka
    Parallel Maximum Independent Set in Convex Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:59, n:6, pp:289-294 [Journal]
  53. Artur Czumaj, Magnús M. Halldórsson, Andrzej Lingas, Johan Nilsson
    Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:94, n:2, pp:49-53 [Journal]
  54. Maxime Crochemore, Artur Czumaj, Leszek Gasieniec, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
    Fast Practical Multi-Pattern Matching. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:71, n:3-4, pp:107-113 [Journal]
  55. Artur Czumaj
    Very Fast Approximation of the Matrix Chain Product Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:21, n:1, pp:71-79 [Journal]
  56. Artur Czumaj, Leszek Gasieniec, Marek Piotrów, Wojciech Rytter
    Sequential and Parallel Approximation of Shortest Superstrings. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:23, n:1, pp:74-100 [Journal]
  57. Artur Czumaj, Wojciech Rytter
    Broadcasting algorithms in radio networks with unknown topology. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2006, v:60, n:2, pp:115-143 [Journal]
  58. Artur Czumaj
    Recovery Time of Dynamic Allocation Processes. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2000, v:33, n:5/6, pp:465-487 [Journal]
  59. Artur Czumaj, Miroslaw Kutylowski
    Delayed path coupling and generating random permutations. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2000, v:17, n:3-4, pp:238-259 [Journal]
  60. Artur Czumaj, Christian Scheideler
    Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2000, v:17, n:3-4, pp:213-237 [Journal]
  61. Artur Czumaj, Volker Stemann
    Randomized allocation processes. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2001, v:18, n:4, pp:297-331 [Journal]
  62. Petra Berenbrink, Artur Czumaj, Angelika Steger, Berthold Vöcking
    Balanced Allocations: The Heavily Loaded Case. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:35, n:6, pp:1350-1385 [Journal]
  63. Artur Czumaj, Funda Ergün, Lance Fortnow, Avner Magen, Ilan Newman, Ronitt Rubinfeld, Christian Sohler
    Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:1, pp:91-109 [Journal]
  64. Artur Czumaj, Friedhelm Meyer auf der Heide, Volker Stemann
    Contention Resolution in Hashing Based Shared Memory Simulations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:5, pp:1703-1739 [Journal]
  65. Artur Czumaj, Christian Sohler
    Abstract Combinatorial Programs and Efficient Property Testers. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:3, pp:580-615 [Journal]
  66. Artur Czumaj, Leszek Gasieniec, Andrzej Pelc
    Time and Cost Trade-Offs in Gossiping. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1998, v:11, n:3, pp:400-413 [Journal]
  67. Artur Czumaj, Berthold Vöcking
    Tight bounds for worst-case equilibria. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:1, pp:- [Journal]
  68. René Beier, Artur Czumaj, Piotr Krysta, Berthold Vöcking
    Computing equilibria for a service provider game with (Im)perfect information. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:4, pp:679-706 [Journal]
  69. Bogdan S. Chlebus, Artur Czumaj, Leszek Gasieniec, Miroslaw Kowaluk, Wojciech Plandowski
    Algorithms for the parallel alternating direction access machine. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:245, n:2, pp:151-173 [Journal]
  70. Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito
    Efficient web searching using temporal factors. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:569-582 [Journal]
  71. Artur Czumaj, Alan Gibbons
    Guthrie's Problem: New Equivalences and Rapid Reductions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:154, n:1, pp:3-22 [Journal]
  72. Artur Czumaj, Leszek Gasieniec, Daya Ram Gaur, Ramesh Krishnamurti, Wojciech Rytter, Michele Zito
    On polynomial-time approximation algorithms for the variable length scheduling problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:489-495 [Journal]
  73. Artur Czumaj, Christian Sohler
    Testing hypergraph colorability. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:331, n:1, pp:37-52 [Journal]
  74. Artur Czumaj, Gereon Frahling, Christian Sohler
    Efficient Kinetic Data Structures for MaxCut. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:157-160 [Conf]
  75. Artur Czumaj, Xin Wang
    Communication Problems in Random Line-of-Sight Ad-Hoc Radio Networks. [Citation Graph (0, 0)][DBLP]
    SAGA, 2007, pp:70-81 [Conf]
  76. Artur Czumaj, Andrzej Lingas
    Finding a heaviest triangle is not harder than matrix multiplication. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:986-994 [Conf]
  77. Artur Czumaj, Christian Sohler
    On testable properties in bounded degree graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:494-501 [Conf]
  78. Artur Czumaj, Miroslaw Kowaluk, Andrzej Lingas
    Faster algorithms for finding lowest common ancestors in directed acyclic graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:380, n:1-2, pp:37-46 [Journal]

  79. 05291 Abstracts Collection -- Sublinear Algorithms. [Citation Graph (, )][DBLP]


  80. Local Graph Exploration and Fast Property Testing. [Citation Graph (, )][DBLP]


  81. Testing Expansion in Bounded-Degree Graphs. [Citation Graph (, )][DBLP]


  82. Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks. [Citation Graph (, )][DBLP]


  83. PTAS for k-Tour Cover Problem on the Plane for Moderately Large Values of k. [Citation Graph (, )][DBLP]


  84. Testing Monotone Continuous Distributions on High-dimensional Real Cubes. [Citation Graph (, )][DBLP]


  85. Approximation Algorithms for Buy-at-Bulk Geometric Network Design. [Citation Graph (, )][DBLP]


  86. PTAS for k-tour cover problem on the plane for moderately large values of k [Citation Graph (, )][DBLP]


  87. Finding Cycles and Trees in Sublinear Time [Citation Graph (, )][DBLP]


  88. Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs. [Citation Graph (, )][DBLP]


  89. Faster algorithms for finding lowest common ancestors in directed acyclic graphs. [Citation Graph (, )][DBLP]


  90. Finding a Heaviest Triangle is not Harder than Matrix Multiplication. [Citation Graph (, )][DBLP]


Search in 0.065secs, Finished in 0.070secs
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