Startseite > Publikationen > Publikationen

Publikationen von Artur Czumaj


Unsere Publikationen aus dem Jahr 2007:



Czumaj, Artur; Frahling, Gereon; Sohler, Christian: Efficient kinetic data structures for MaxCut. In: Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG), S. 157-160, Jan. 2007 (Details)

Czumaj, Artur; Sohler, Christian: Small Space Representations for Metric Min-Sum k-Clustering and their Applications. In: Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS'07), S. 536-548, Jan. 2007 (Details)

Czumaj, Artur; Sohler, Christian: Testing Expansion in Bounded-Degree Graphs. In: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS), S. 570 - 578, Jan. 2007 (Details)

Czumaj, Artur; Sohler, Christian: On Testable Properties in Bounded Degree Graphs. In: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA'07), S. 494-501, Jan. 2007 (Details)


Unsere Publikationen aus dem Jahr 2006:



Czumaj, Artur; Sohler, Christian: Sublinear-time Algorithms. EATCS Bulletin, (89): S. 23--47, Jun. 2006 (Details)


Unsere Publikationen aus dem Jahr 2005:



Czumaj, Artur; Sohler, Christian: Testing Hypergraph Coloring.. Theoretical Computer Science, 331(1): S. 37-52 2005 (Details)

Badoiu, M.; Czumaj, Artur; Indyk, Piotr; Sohler, Christian: Facility Location in Sublinear Time.. In: Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), S. 866-877, 2005 (Details)

Czumaj, Artur; Ergun, Funda; Fortnow, Lance; Magen, Avner; Newman, Ilan; Rubinfeld, Ronitt; Sohler, Christian: Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time. SIAM J. Comput., 35(1): S. 91-109, Jan. 2005 (Details)


Unsere Publikationen aus dem Jahr 2004:



Czumaj, Artur; Sohler, Christian: Sublinear-Time Approximation for Clustering via Random Sampling. In: Automata, Languages and Programming (ICALP), LNCS 3142, Nr. 1 , S. 396-407, 2004 (Details)


Unsere Publikationen aus dem Jahr 2003:



Czumaj, Artur; Ergun, Funda; Fortnow, Lance; Magen, Avner; Newman, Ilan; Rubinfeld, Ronitt; Sohler, Christian: Sublinear Approximation of Euclidean Minimum Spanning Tree. In: Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), S. 813-822, 2003 (Details)


Unsere Publikationen aus dem Jahr 2002:



Czumaj, Artur; Sohler, Christian: Abstract Combinatorial Programs and Efficient Property Testers. Proceedings of the 43th Symposium on Foundations of Computer Science (FOCS): S. 83-92 2002 (Details)


Unsere Publikationen aus dem Jahr 2001:



Czumaj, Artur; Sohler, Christian: Soft Kinetic Data Structures. In: Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, S. 865-872, 1. Mai 2001 (Details)

Czumaj, Artur; Sohler, Christian: Testing Hypergraph Coloring. Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP): S. 493-505 2001 (Details)

Czumaj, Artur; Sohler, Christian: Property Testing with Geometric Queries.. Proceedings of the 9th Annual European Symposium on Algorithms (ESA`01): S. 266-277 2001 (Details)


Unsere Publikationen aus dem Jahr 2000:



Czumaj, Artur; Sohler, Christian; Ziegler, Martin: Property Testing in Computational Geometry. In: Proceedings of the 8th Annual European Symposium on Algorithms (ESA'00), Lecture Notes in Computer Science, Band 1879 , S. 155-166, 2000 (Details)


Unsere Publikationen aus dem Jahr 1999:



Czumaj, Artur; Lingas, Andrzej: On Approximability of the Minimum-Cost k-Connected Spanning Subgraph Problem. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, S. 281-290, 17. - 19. Jan. 1999 (Details)


Unsere Publikationen aus dem Jahr 1998:



Czumaj, Artur; Lingas, Andrzej: A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity. In: Proceedings of the 25th International Colloquium on Automata, Languages, and Programming, LNCS, Band 1113 , S. 682-694, Jan. 1998, Springer-Verlag (Details)


Unsere Publikationen aus dem Jahr 1997:



Czumaj, Artur; Strothmann, Willy-Bernhard: Bounded Degree Spanning Trees. In: Proceedings of the Fifth Annual European Symposium on Algorithms (ESA'97), LNCS, Band 1284 , S. 104-117, 1997, Springer Verlag (Details)

Breslauer, Dany; Czumaj, Artur; Devdatt, P. Dubhashi: Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine. Inf. Process. Lett., 62(2): S. 103-110 1997 (Details)


Unsere Publikationen aus dem Jahr 1996:




Unsere Publikationen aus dem Jahr 1995:



Czumaj, Artur: Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations. Dissertation, Universität Paderborn, Heinz Nixdorf Institut, Theoretische Informatik, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, Band 8, Paderborn, Jan. 1995 (Details)