| Year |
Citation |
Score |
| 2024 |
Czumaj A, Davies-Peck P, Parter M. Component stability in low-space massively parallel computation. Distributed Computing. 37: 35-64. PMID 38370529 DOI: 10.1007/s00446-024-00461-9 |
0.366 |
|
| 2019 |
Czumaj A, Ła̧cki J, Ma̧dry A, Mitrović S, Onak K, Sankowski P. Round Compression for Parallel Matching Algorithms Siam Journal On Computing. DOI: 10.1137/18M1197655 |
0.431 |
|
| 2019 |
Czumaj A, Davies P. Leader Election in Multi-Hop Radio Networks Theoretical Computer Science. 792: 2-11. DOI: 10.1016/J.Tcs.2019.02.027 |
0.426 |
|
| 2019 |
Czumaj A, Davies P. Communicating with beeps Journal of Parallel and Distributed Computing. 130: 98-109. DOI: 10.1016/J.Jpdc.2019.03.020 |
0.319 |
|
| 2019 |
Czumaj A, Deligkas A, Fasoulakis M, Fearnley J, Jurdziński M, Savani R. Distributed Methods for Computing Approximate Equilibria Algorithmica. 81: 1205-1231. DOI: 10.1007/S00453-018-0465-Y |
0.479 |
|
| 2019 |
Czumaj A, Konrad C. Detecting cliques in CONGEST networks Distributed Computing. 1-11. DOI: 10.1007/S00446-019-00368-W |
0.383 |
|
| 2018 |
Czumaj A, Krauthgamer R. 3rd Highlights of Algorithms (HALG 2018) Sigact News. 49: 74-77. DOI: 10.1145/3289137.3289151 |
0.415 |
|
| 2018 |
Czumaj A, Davies P. Deterministic Communication in Radio Networks Siam Journal On Computing. 47: 218-240. DOI: 10.1137/17M1111322 |
0.409 |
|
| 2017 |
Czumaj A, Leonardi S. HALG: Highlights of Algorithms Sigact News. 48: 83-86. DOI: 10.1145/3138860.3138873 |
0.396 |
|
| 2014 |
Czumaj A, Goldreich O, Ron D, Seshadhri C, Shapira A, Sohler C. Finding cycles and trees in sublinear time Random Structures and Algorithms. 45: 139-184. DOI: 10.1002/Rsa.20462 |
0.458 |
|
| 2013 |
Czumaj A, Elsässer R, Ga̧sieniec L, Sauerwald T, Wang X. Fast message dissemination in random geometric networks Distributed Computing. 26: 1-24. DOI: 10.1007/S00446-011-0154-4 |
0.377 |
|
| 2013 |
Czumaj A, Lammersen C, Monemizadeh M, Sohler C. (1 + ε)-approximation for facility location in data streams Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1710-1728. |
0.383 |
|
| 2012 |
Adamaszek A, Czumaj A, Englert M, Räcke H. An O(log k)-competitive algorithm for generalized caching Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 1681-1689. DOI: 10.1145/3280826 |
0.424 |
|
| 2012 |
Berenbrink P, Czumaj A, Englert M, Friedetzky T, Nagel L. Multiple-choice balanced allocation in (almost) parallel Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7408: 411-422. DOI: 10.1007/978-3-642-32512-0_35 |
0.311 |
|
| 2011 |
Adamaszek A, Czumaj A, Englert M, Räcke H. Almost tight bounds for reordering buffer management Proceedings of the Annual Acm Symposium On Theory of Computing. 607-616. DOI: 10.1145/1993636.1993717 |
0.339 |
|
| 2011 |
Adamaszek A, Czumaj A, Lingas A, Wojtaszczyk JO. Approximation schemes for capacitated geometric network design Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6755: 25-36. DOI: 10.1137/16M1108005 |
0.379 |
|
| 2011 |
Czumaj A, Monemizadeh M, Onak K, Sohler C. Planar graphs: Random walks and bipartiteness testing Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 423-432. DOI: 10.1002/Rsa.20826 |
0.405 |
|
| 2010 |
Adamaszek A, Czumaj A, Lingas A. Ptas for κ-tour cover problem on the plane for moderately large values of κ International Journal of Foundations of Computer Science. 21: 893-904. DOI: 10.1142/S0129054110007623 |
0.324 |
|
| 2010 |
Czumaj A, Sohler C. Small space representations for metric min-sum k-clustering and their applications Theory of Computing Systems. 46: 416-442. DOI: 10.1007/S00224-009-9235-1 |
0.472 |
|
| 2010 |
Czumaj A, Sohler C. Sublinear-time algorithms Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6390: 41-64. DOI: 10.1007/978-3-642-16367-8_5 |
0.316 |
|
| 2009 |
Czumaj A, Lingas A. Finding a heaviest vertex-weight ed triangle is not harder than matrix multiplication Siam Journal On Computing. 39: 431-444. DOI: 10.1137/070695149 |
0.5 |
|
| 2009 |
Czumaj A, Shapira A, Sohler C. Testing hereditary properties of nonexpanding bounded-degree graphs Siam Journal On Computing. 38: 2499-2510. DOI: 10.1137/070681831 |
0.366 |
|
| 2009 |
Czumaj A, Sohler C. Estimating the weight of metric minimum spanning trees in sublinear time Siam Journal On Computing. 39: 904-922. DOI: 10.1137/060672121 |
0.403 |
|
| 2009 |
Czumaj A, Czyzowicz J, Ga̧sieniec L, Jansson J, Lingas A, Zylinski P. Approximation algorithms for buy-at-bulk geometric network design Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5664: 168-180. DOI: 10.1007/978-3-642-03367-4_15 |
0.32 |
|
| 2008 |
Czumaj A, Sohler C. Testing Euclidean minimum spanning trees in the plane Acm Transactions On Algorithms. 4. DOI: 10.1145/1367064.1367071 |
0.426 |
|
| 2007 |
Czumaj A, Vöcking B. Tight bounds for worst-case equilibria Acm Transactions On Algorithms. 3. DOI: 10.1145/1186810.1186814 |
0.346 |
|
| 2007 |
Czumaj A, Sohler C. Testing expansion in bounded-degree graphs Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 570-578. DOI: 10.1017/S096354831000012X |
0.419 |
|
| 2007 |
Czumaj A, Kowaluk M, Lingas A. Faster algorithms for finding lowest common ancestors in directed acyclic graphs Theoretical Computer Science. 380: 37-46. DOI: 10.1016/J.Tcs.2007.02.053 |
0.509 |
|
| 2007 |
Czumaj A, Sohler C. Sublinear-time approximation algorithms for clustering via random sampling Random Structures and Algorithms. 30: 226-256. DOI: 10.1002/Rsa.V30:1/2 |
0.411 |
|
| 2007 |
Czumaj A, Lingas A. Finding a heaviest triangle is not harder than matrix multiplication Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 7: 986-994. |
0.427 |
|
| 2006 |
Czumaj A, Jansen K, Heide FMad, Schiermeyer I. Algorithmic Graph Theory Oberwolfach Reports. 3: 379-460. DOI: 10.4171/Owr/2006/07 |
0.423 |
|
| 2006 |
Beier R, Czumaj A, Krysta P, Vöcking B. Computing equilibria for a service provider game with (Im)perfect information Acm Transactions On Algorithms. 2: 679-706. DOI: 10.1145/1198513.1198524 |
0.321 |
|
| 2006 |
Czumaj A, Ergün F, Fortnow L, Magen A, Newman I, Rubinfeld R, Sohler C. Approximating the weight of the Euclidean minimum spanning tree in sublinear time Siam Journal On Computing. 35: 91-109. DOI: 10.1137/S0097539703435297 |
0.439 |
|
| 2005 |
Czumaj A, Halldórsson MM, Lingas A, Nilsson J. Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth Information Processing Letters. 94: 49-53. DOI: 10.1016/J.Ipl.2004.12.017 |
0.417 |
|
| 2005 |
Bǎdoiu M, Czumaj A, Indyk P, Sohler C. Facility Location in sublinear time Lecture Notes in Computer Science. 3580: 866-877. |
0.375 |
|
| 2004 |
Czumaj A, Sohler C. Estimating the weight of metric minimum spanning trees in sublinear-time Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 175-183. DOI: 10.1137/060672121 |
0.475 |
|
| 2004 |
Czumaj A, Grigni M, Sissokho P, Zhao H. Approximation Schemes for Minimum 2-Edge-Connected and Biconnected Subgraphs in Planar Graphs Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 15: 489-498. |
0.313 |
|
| 2003 |
Czumaj A, Ga̧sieniec L, Gaur DR, Krishnamurti R, Rytter W, Zito M. On polynomial-time approximation algorithms for the variable length scheduling problem Theoretical Computer Science. 302: 489-495. DOI: 10.1016/S0304-3975(03)00141-5 |
0.356 |
|
| 2003 |
Czumaj A, Rytter W. Broadcasting algorithms in radio networks with unknown topology Proceedings - Annual Ieee Symposium On Foundations of Computer Science, Focs. 2003: 492-501. DOI: 10.1016/J.Jalgor.2004.08.001 |
0.485 |
|
| 2003 |
Czumaj A, Zhao H. Fault-tolerant geometric spanners Proceedings of the Annual Symposium On Computational Geometry. 1-10. DOI: 10.1007/S00454-004-1121-7 |
0.531 |
|
| 2003 |
Czumaj A, Ergün F, Fortnow L, Magen A, Newman I, Rubinfeld R, Sohler C. Sublinear-time approximation of Euclidean minimum spanning tree Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 813-822. |
0.35 |
|
| 2003 |
Czumaj A, Lingas A, Nilsson J. Improved approximation algorithms for optimization problems in graphs with superlogarithmic treewidth Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2906: 544-553. |
0.423 |
|
| 2002 |
Czumaj A, Sohler C. Abstract combinatorial programs and efficient property testers Annual Symposium On Foundations of Computer Science - Proceedings. 83-92. DOI: 10.1137/S009753970444199X |
0.374 |
|
| 2002 |
Czumaj A, Krysta P, Vöcking B. Selfish traffic allocation for server farms Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 287-296. DOI: 10.1137/070693862 |
0.35 |
|
| 2002 |
Czumaj A, Lingas A, Zhao H. Polynomial-time approximation schemes for the euclidean survivable network design problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2380: 973-984. |
0.323 |
|
| 2001 |
Czumaj A, Finch I, Gasieniec L, Gibbons A, Leng P, Rytter W, Zito M. Efficient web searching using temporal factors Theoretical Computer Science. 262: 569-582. DOI: 10.1016/S0304-3975(00)00366-2 |
0.43 |
|
| 2001 |
Czumaj A, Stemann V. Randomized allocation processes Random Structures and Algorithms. 18: 297-331. DOI: 10.1002/Rsa.1011 |
0.317 |
|
| 2000 |
Czumaj A, Scheideler C. A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract) Proceedings of the Annual Acm Symposium On Theory of Computing. 38-47. DOI: 10.1145/335305.335310 |
0.305 |
|
| 2000 |
Czumaj A, Meyer Auf Der Heide F, Stemann V. Contention resolution in hashing based shared memory simulations Siam Journal On Computing. 29: 1703-1739. DOI: 10.1137/S009753979529564X |
0.375 |
|
| 2000 |
Berenbrink P, Czumaj A, Steger A, Vöcking B. Balanced allocations: The heavily loaded case Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 745-754. DOI: 10.1137/S009753970444435X |
0.344 |
|
| 2000 |
Chlebus BS, Czumaj A, Ga̧sieniec L, Kowaluk M, Plandowski W. Algorithms for the parallel alternating direction access machine Theoretical Computer Science. 245: 151-173. DOI: 10.1016/S0304-3975(99)00280-7 |
0.367 |
|
| 2000 |
Czumaj A, Kutyłowski M. Delayed path coupling and generating random permutations Random Structures and Algorithms. 17: 238-259. DOI: 10.1002/1098-2418(200010/12)17:3/4<238::Aid-Rsa4>3.0.Co;2-E |
0.381 |
|
| 2000 |
Czumaj A, Scheideler C. Coloring nonuniform hypergraphs: A new algorithmic approach to the general lovász local lemma Random Structures and Algorithms. 17: 213-237. DOI: 10.1002/1098-2418(200010/12)17:3/4<213::Aid-Rsa3>3.0.Co;2-Y |
0.466 |
|
| 2000 |
Czumaj A, Gaşieniec L. On the complexity of determining the period of a string Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1848: 412-422. |
0.332 |
|
| 2000 |
Czumaj A, Lingas A. Fast approximation schemes for Euclidean multi-connectivity problems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1853: 856-868. |
0.347 |
|
| 1999 |
Crochemore M, Czumaj A, Ga̧sieniec L, Lecroq T, Plandowski W, Rytter W. Fast practical multi-pattern matching Information Processing Letters. 71: 107-113. DOI: 10.1016/S0020-0190(99)00092-7 |
0.425 |
|
| 1998 |
Czumaj A, Ga̧sieniec L, Pelc A. Time and cost trade-offs in gossiping Siam Journal On Discrete Mathematics. 11: 400-413. DOI: 10.1137/S0895480295292934 |
0.439 |
|
| 1998 |
Czumaj A. Recovery time of dynamic allocation processes Annual Acm Symposium On Parallel Algorithms and Architectures. 202-211. DOI: 10.1007/S002240010012 |
0.301 |
|
| 1998 |
Czumaj A, Kanarek P, Kutyłowski M, Loryś K. Fast generation of random permutations via networks simulation Algorithmica (New York). 21: 2-20. DOI: 10.1007/Pl00009206 |
0.503 |
|
| 1998 |
Czumaj A, Lingas A. A polynomial time approximation scheme for euclidean minimum cost k-connectivity Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1443: 682-694. |
0.31 |
|
| 1997 |
Breslauer D, Czumaj A, Dubhashi DP, Meyer Auf Der Heide F. Transforming comparison model lower bounds to the parallel-random-access-machine Information Processing Letters. 62: 103-110. DOI: 10.1016/S0020-0190(97)00032-X |
0.333 |
|
| 1997 |
Czumaj A, Ga̧sieniec L, Piotrów M, Rytter W. Sequential and Parallel Approximation of Shortest Superstrings Journal of Algorithms. 23: 74-100. DOI: 10.1006/Jagm.1996.0823 |
0.463 |
|
| 1997 |
Czumaj A, Meyer Auf Der Heide F, Stemann V. Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures Information and Computation. 137: 103-120. DOI: 10.1006/Inco.1997.2642 |
0.343 |
|
| 1997 |
Chlebus BS, Czumaj A, Sibeyn JF. Routing on the PADAM: Degrees of optimality Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1300: 272-279. |
0.343 |
|
| 1996 |
Czumaj A, Gibbons A. Guthrie's problem: New equivalences and rapid reductions Theoretical Computer Science. 154: 3-22. DOI: 10.1016/0304-3975(95)00126-3 |
0.314 |
|
| 1996 |
Czumaj A, Diks K, Przytycka TM. Parallel maximum independent set in convex bipartite graphs Information Processing Letters. 59: 289-294. DOI: 10.1016/0020-0190(96)00131-7 |
0.488 |
|
| 1996 |
Czumaj A. Very Fast Approximation of the Matrix Chain Product Problem Journal of Algorithms. 21: 71-79. DOI: 10.1006/Jagm.1996.0037 |
0.465 |
|
| 1994 |
Crochemore M, Czumaj A, Gasieniec L, Jarominek S, Lecroq T, Plandowski W, Rytter W. Speeding up two string-matching algorithms Algorithmica. 12: 247-267. DOI: 10.1007/Bf01185427 |
0.441 |
|
| Show low-probability matches. |