Artur Czumaj
Orcid: 0000-0002-7743-438XAffiliations:
- University of Warwick, UK
According to our database1,
Artur Czumaj
authored at least 172 papers
between 1992 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
Distributed Comput., March, 2024
Theor. Comput. Sci., February, 2024
SIAM J. Comput., 2024
Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, 2024
Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing, 2024
Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2024
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024
Proceedings of the 2024 ACM Workshop on Highlights of Parallel Computing, 2024
2023
Random Struct. Algorithms, July, 2023
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023
2022
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022
2021
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space.
ACM Trans. Algorithms, 2021
SIAM J. Comput., 2021
Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks.
J. ACM, 2021
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021
Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021
2020
Sublinear time approximation of the cost of a metric <i>k</i>-nearest neighbor graph.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020
Proceedings of the Approximation, 2020
2019
ACM Trans. Algorithms, 2019
Random Struct. Algorithms, 2019
A characterization of graph properties testable for general planar graphs with one-sided error (It is all about forbidden subgraphs).
CoRR, 2019
A Characterization of Graph Properties Testable for General Planar Graphs with one-Sided Error (It's all About Forbidden Subgraphs).
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019
2018
SIAM J. Discret. Math., 2018
Proceedings of the 32nd International Symposium on Distributed Computing, 2018
Proceedings of the 32nd International Symposium on Distributed Computing, 2018
Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018
Proceedings of the 26th Annual European Symposium on Algorithms, 2018
Approximation Schemes for Minimum-Cost k-Connectivity Problems in Geometric Graphs.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018
2017
Proceedings of the Encyclopedia of Machine Learning and Data Mining, 2017
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017
2016
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016
Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016
2015
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015
2014
Proceedings of the Algorithmic Game Theory - 7th International Symposium, 2014
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014
2013
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013
2012
Electron. Colloquium Comput. Complex., 2012
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012
2011
Int. J. Found. Comput. Sci., 2011
2010
Small Space Representations for Metric Min-sum <i>k</i>-Clustering and Their Applications.
Theory Comput. Syst., 2010
Int. J. Found. Comput. Sci., 2010
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010
Proceedings of the Property Testing - Current Research and Surveys, 2010
Proceedings of the Property Testing - Current Research and Surveys, 2010
Proceedings of the Algorithms, 2010
2009
SIAM J. Comput., 2009
SIAM J. Comput., 2009
Finding a Heaviest Vertex-Weighted Triangle Is not Harder than Matrix Multiplication.
SIAM J. Comput., 2009
PTAS for <i>k</i>-Tour Cover Problem on the Plane for Moderately Large Values of <i>k</i>.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009
2008
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
Proceedings of the Sublinear Algorithms, 17.08. - 22.08.2008, 2008
Proceedings of the Sublinear Algorithms, 17.08. - 22.08.2008, 2008
2007
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007
Theor. Comput. Sci., 2007
Random Struct. Algorithms, 2007
Electron. Colloquium Comput. Complex., 2007
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007
Proceedings of the Stochastic Algorithms: Foundations and Applications, 2007
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007
2006
ACM Trans. Algorithms, 2006
Electron. Colloquium Comput. Complex., 2006
Sublinear-Time Algorithms.
Bull. EATCS, 2006
2005
SIAM J. Comput., 2005
SIAM J. Comput., 2005
Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth.
Inf. Process. Lett., 2005
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005
Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs.
Proceedings of the Algorithms, 2005
Proceedings of the Sublinear Algorithms, 17.07. - 22.07.2005, 2005
2004
Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004
Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004
Proceedings of the Proceedings 5th ACM Conference on Electronic Commerce (EC-2004), 2004
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004
2003
On polynomial-time approximation algorithms for the variable length scheduling problem.
Theor. Comput. Sci., 2003
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003
Improved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003
2002
Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem.
Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002
2001
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001
2000
Theor. Comput. Sci., 2000
SIAM J. Comput., 2000
Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma.
Random Struct. Algorithms, 2000
Random Struct. Algorithms, 2000
A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract).
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000
Proceedings of the Twelfth annual ACM Symposium on Parallel Algorithms and Architectures, 2000
Coloring non-uniform hypergraphs: a new algorithmic approach to the general Lovász local lemma.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000
Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000
1999
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999
Delayed Path Coupling and Generating Random Permutations via Distributed Stochastic Processes.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999
1998
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998
1997
Inf. Process. Lett., 1997
Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures.
Inf. Comput., 1997
The Architecture of a Software Library for String Processing.
Proceedings of the Workshop on Algorithm Engineering, 1997
Proceedings of the Euro-Par '97 Parallel Processing, 1997
Proceedings of the Algorithms, 1997
1996
Inf. Process. Lett., 1996
Proceedings of the Mathematical Foundations of Computer Science 1996, 1996
1995
PhD thesis, 1995
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995
Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995
Proceedings of the Algorithms, 1995
1994
Proceedings of the Algorithm Theory, 1994
1993
Parallel Algorithm for the Matrix Chain Product and the Optimal Triangulation Problems (Extended Abstract).
Proceedings of the STACS 93, 1993
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993
1992
An Optimal Parallel Algorithm for Computing a Near-Optimal Order of Matrix Multiplications.
Proceedings of the Algorithm Theory, 1992