Artur Czumaj

Peter Davies-Peck

Distributed Comput., March, 2024

Routing schemes for hybrid communication networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., February, 2024

2023

Deterministic Massively Parallel Connectivity.

[BibT_eX]

[DOI]

Sam Coy

SIAM J. Comput., October, 2023

On parallel time in population protocols.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2023

Fully Scalable MPC Algorithms for Clustering in High Dimension.

[BibT_eX]

[DOI]

CoRR, 2023

Fast Parallel Degree+1 List Coloring.

[BibT_eX]

[DOI]

CoRR, 2023

On Parallel k-Center Clustering.

[BibT_eX]

[DOI]

Sam Coy

Gopinath Mishra

Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Modern Parallel Algorithms (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Optimal (Degree+1)-Coloring in Congested Clique.

[BibT_eX]

[DOI]

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022

Almost Tight Bounds for Reordering Buffer Management.

[BibT_eX]

[DOI]

SIAM J. Comput., 2022

Routing Schemes for Hybrid Communication Networks in Unit-Disk Graphs.

[BibT_eX]

[DOI]

CoRR, 2022

Streaming Facility Location in High Dimension via New Geometric Hashing.

[BibT_eX]

[DOI]

CoRR, 2022

Streaming Algorithms for Geometric Steiner Forest.

[BibT_eX]

[DOI]

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Streaming Facility Location in High Dimension via Geometric Hashing.

[BibT_eX]

[DOI]

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021

Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2021

Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC.

[BibT_eX]

[DOI]

SIAM J. Comput., 2021

Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks.

[BibT_eX]

[DOI]

J. ACM, 2021

Letter from the President.

[BibT_eX]

[DOI]

Bull. EATCS, 2021

On Truly Parallel Time in Population Protocols.

[BibT_eX]

[DOI]

CoRR, 2021

Component Stability in Low-Space Massively Parallel Computation.

[BibT_eX]

[DOI]

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Improved Deterministic (Δ+1) Coloring in Low-Space MPC.

[BibT_eX]

[DOI]

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Near-Shortest Path Routing in Hybrid Communication Networks.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021

Haystack Hunting Hints and Locker Room Communication.

[BibT_eX]

[DOI]

George Kontogeorgiou

Mike Paterson

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Round Compression for Parallel Matching Algorithms.

[BibT_eX]

[DOI]

SIAM J. Comput., 2020

Report on ICALP 2020.

[BibT_eX]

[DOI]

Anca Muscholl

Bull. EATCS, 2020

The EATCS Award 2020 - Laudatio for Mihalis Yannakakis.

[BibT_eX]

[DOI]

Bull. EATCS, 2020

Detecting cliques in CONGEST networks.

[BibT_eX]

[DOI]

Christian Konrad

Distributed Comput., 2020

Combinatorial Communication in the Locker Room.

[BibT_eX]

[DOI]

George Kontogeorgiou

Mike Paterson

CoRR, 2020

Sublinear time approximation of the cost of a metric k-nearest neighbor graph.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Simple, Deterministic, Constant-Round Coloring in the Congested Clique.

[BibT_eX]

[DOI]

Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020

Testable Properties in General Graphs and Random Order Streaming.

[BibT_eX]

[DOI]

Hendrik Fichtenberger

Pan Peng

Proceedings of the Approximation, 2020

2019

Leader election in multi-hop radio networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

An O(log k)-Competitive Algorithm for Generalized Caching.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

Planar graphs: Random walks and bipartiteness testing.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2019

Communicating with beeps.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2019

The EATCS Award 2020 - Call for Nominations.

[BibT_eX]

[DOI]

Marta Kwiatkowska

Éva Tardos

Bull. EATCS, 2019

A characterization of graph properties testable for general planar graphs with one-sided error (It is all about forbidden subgraphs).

[BibT_eX]

[DOI]

CoRR, 2019

Distributed Methods for Computing Approximate Equilibria.

[BibT_eX]

[DOI]

Algorithmica, 2019

A Characterization of Graph Properties Testable for General Planar Graphs with one-Sided Error (It's all About Forbidden Subgraphs).

[BibT_eX]

[DOI]

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018

3rd Highlights of Algorithms (HALG 2018).

[BibT_eX]

[DOI]

Robert Krauthgamer

SIGACT News, 2018

Approximation Schemes for Capacitated Geometric Network Design.

[BibT_eX]

[DOI]

Anna Adamaszek

Jakub Onufry Wojtaszczyk

SIAM J. Discret. Math., 2018

Deterministic Communication in Radio Networks.

[BibT_eX]

[DOI]

SIAM J. Comput., 2018

Report on HALG 2018.

[BibT_eX]

[DOI]

Robert Krauthgamer

Bull. EATCS, 2018

Randomized Communication Without Network Knowledge.

[BibT_eX]

[DOI]

CoRR, 2018

Brief Announcement: Randomized Blind Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Deterministic Blind Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Sublinear Graph Augmentation for Fast Query Implementation.

[BibT_eX]

[DOI]

Yishay Mansour

Shai Vardi

Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

Online Facility Location with Deletions.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Approximation Schemes for Minimum-Cost k-Connectivity Problems in Geometric Graphs.

[BibT_eX]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017

Sublinear Clustering.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Machine Learning and Data Mining, 2017

HALG: Highlights of Algorithms.

[BibT_eX]

[DOI]

Stefano Leonardi

SIGACT News, 2017

Report on HALG 2016/2017.

[BibT_eX]

[DOI]

Stefano Leonardi

Bull. EATCS, 2017

Zero-Sum Game Techniques for Approximate Nash Equilibria.

[BibT_eX]

[DOI]

Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

Multi-player Approximate Nash Equilibria.

[BibT_eX]

[DOI]

Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

2016

Price of Anarchy for Machines Models.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Minimum k-Connected Geometric Networks.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Euclidean Traveling Salesman Problem.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

Relating two property testing models for bounded degree directed graphs.

[BibT_eX]

[DOI]

Pan Peng

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Brief Announcement: Optimal Leader Election in Multi-Hop Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Faster Deterministic Communication in Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Approximate Plutocratic and Egalitarian Nash Equilibria: (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, 2016

2015

Almost Optimal Deterministic Broadcast in Radio Networks.

[BibT_eX]

[DOI]

CoRR, 2015

Optimal leader election in multi-hop radio networks.

[BibT_eX]

[DOI]

CoRR, 2015

Testing Cluster Structure of Graphs.

[BibT_eX]

[DOI]

Pan Peng

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Random Permutations using Switching Networks.

[BibT_eX]

[DOI]

Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Approximate Nash Equilibria with Near Optimal Social Welfare.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2014

Approximate Well-Supported Nash Equilibria in Symmetric Bimatrix Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 7th International Symposium, 2014

Thorp Shuffling, Butterflies, and Non-Markovian Couplings.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

Fast message dissemination in random geometric networks.

[BibT_eX]

[DOI]

Distributed Comput., 2013

(1+ Є)-approximation for facility location in data streams.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012

Finding Cycles and Trees in Sublinear Time.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2012

Optimal online buffer scheduling for block devices.

[BibT_eX]

[DOI]

Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Multiple-Choice Balanced Allocation in (Almost) Parallel.

[BibT_eX]

[DOI]

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2012

2011

Approximation Algorithms for Buy-at-Bulk Geometric Network Design.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

2010

Sublinear Clustering.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Machine Learning, 2010

Selfish Traffic Allocation for Server Farms.

[BibT_eX]

[DOI]

Piotr Krysta

SIAM J. Comput., 2010

Small Space Representations for Metric Min-sum k-Clustering and Their Applications.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2010

Ptas for k-Tour Cover Problem on the Plane for Moderately Large Values of k.

[BibT_eX]

[DOI]

Anna Adamaszek

Int. J. Found. Comput. Sci., 2010

Testing Expansion in Bounded-Degree Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2010

Testing Monotone Continuous Distributions on High-dimensional Real Cubes.

[BibT_eX]

[DOI]

Michal Adamaszek

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Sublinear-time Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Property Testing - Current Research and Surveys, 2010

Testing Monotone Continuous Distributions on High-Dimensional Real Cubes.

[BibT_eX]

[DOI]

Michal Adamaszek

Proceedings of the Property Testing - Current Research and Surveys, 2010

Local Graph Exploration and Fast Property Testing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2010

2009

Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs.

[BibT_eX]

[DOI]

Asaf Shapira

SIAM J. Comput., 2009

Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time.

[BibT_eX]

[DOI]

SIAM J. Comput., 2009

Finding a Heaviest Vertex-Weighted Triangle Is not Harder than Matrix Multiplication.

[BibT_eX]

[DOI]

SIAM J. Comput., 2009

PTAS for k-Tour Cover Problem on the Plane for Moderately Large Values of k.

[BibT_eX]

[DOI]

Anna Adamaszek

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008

Price of Anarchy for Machines Models.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Minimum k-Connected Geometric Networks.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Euclidean Traveling Salesperson Problem.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Testing Euclidean minimum spanning trees in the plane.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2008

08341 Executive Summary - Sublinear Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Sublinear Algorithms, 17.08. - 22.08.2008, 2008

08341 Abstracts Collection - Sublinear Algorithms.

[BibT_eX]

[DOI]

S. Muthu Muthukrishnan

Ronitt Rubinfeld

Proceedings of the Sublinear Algorithms, 17.08. - 22.08.2008, 2008

2007

Approximation Schemes for Minimum-Cost k-Connectivity Problems in Geometric Graphs.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Faster algorithms for finding lowest common ancestors in directed acyclic graphs.

[BibT_eX]

[DOI]

Miroslaw Kowaluk

Theor. Comput. Sci., 2007

Tight bounds for worst-case equilibria.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2007

Sublinear-time approximation algorithms for clustering via random sampling.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2007

Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs.

[BibT_eX]

[DOI]

Asaf Shapira

Electron. Colloquium Comput. Complex., 2007

On testable properties in bounded degree graphs.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Communication Problems in Random Line-of-Sight Ad-Hoc Radio Networks.

[BibT_eX]

[DOI]

Xin Wang

Proceedings of the Stochastic Algorithms: Foundations and Applications, 2007

Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks.

[BibT_eX]

[DOI]

Xin Wang

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Efficient Kinetic Data Structures for MaxCut.

[BibT_eX]

[DOI]

Gereon Frahling

Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006

Computing equilibria for a service provider game with (Im)perfect information.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2006

Balanced Allocations: The Heavily Loaded Case.

[BibT_eX]

[DOI]

SIAM J. Comput., 2006

Broadcasting algorithms in radio networks with unknown topology.

[BibT_eX]

[DOI]

Wojciech Rytter

J. Algorithms, 2006

Finding a Heaviest Triangle is not Harder than Matrix Multiplication.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2006

Sublinear-Time Algorithms.

[BibT_eX]

Bull. EATCS, 2006

2005

Testing hypergraph colorability.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Abstract Combinatorial Programs and Efficient Property Testers.

[BibT_eX]

[DOI]

SIAM J. Comput., 2005

Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time.

[BibT_eX]

[DOI]

SIAM J. Comput., 2005

Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth.

[BibT_eX]

[DOI]

Magnús M. Halldórsson

Johan Nilsson

Inf. Process. Lett., 2005

Facility Location in Sublinear Time.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2005

05291 Abstracts Collection -- Sublinear Algorithms.

[BibT_eX]

[DOI]

S. Muthu Muthukrishnan

Ronitt Rubinfeld

Proceedings of the Sublinear Algorithms, 17.07. - 22.07.2005, 2005

2004

Selfish Routing on the Internet.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

Fault-Tolerant Geometric Spanners.

[BibT_eX]

[DOI]

Hairong Zhao

Discret. Comput. Geom., 2004

Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Computing equilibria for congestion games with (im)perfect information.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

On the expected payment of mechanisms for task allocation: [extended abstract].

[BibT_eX]

[DOI]

Amir Ronen

Proceedings of the Proceedings 5th ACM Conference on Electronic Commerce (EC-2004), 2004

On the expected payment of mechanisms for task allocation.

[BibT_eX]

[DOI]

Amir Ronen

Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

Sublinear-Time Approximation for Clustering Via Random Sampling.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003

On polynomial-time approximation algorithms for the variable length scheduling problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Sublinear-time approximation of Euclidean minimum spanning tree.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Perfectly Balanced Allocation.

[BibT_eX]

[DOI]

Chris Riley

Proceedings of the Approximation, 2003

Improved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth.

[BibT_eX]

[DOI]

Johan Nilsson

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2002

Polynomial-Time Approximation Schemes for the Euclidean Survivable Network Design Problem.

[BibT_eX]

[DOI]

Hairong Zhao

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001

Efficient web searching using temporal factors.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Randomized allocation processes.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2001

Soft kinetic data structures.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Testing Hypergraph Coloring.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Property Testing with Geometric Queries.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2001

2000

Algorithms for the parallel alternating direction access machine.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Contention Resolution in Hashing Based Shared Memory Simulations.

[BibT_eX]

[DOI]

SIAM J. Comput., 2000

Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lovász local lemma.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2000

Delayed path coupling and generating random permutations.

[BibT_eX]

[DOI]

Miroslaw Kutylowski

Random Struct. Algorithms, 2000

Recovery Time of Dynamic Allocation Processes.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2000

A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

Infinite parallel job allocation (extended abstract).

[BibT_eX]

[DOI]

Petra Berenbrink

Tom Friedetzky

Nikita D. Vvedenskaya

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.

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Fast Approximation Schemes for Euclidean Multi-connectivity Problems.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

Property Testing in Computational Geometry.

[BibT_eX]

[DOI]

Martin Ziegler

Proceedings of the Algorithms, 2000

On the Complexity of Determining the Period of a String.

[BibT_eX]

[DOI]

Leszek Gasieniec

Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000

1999

Fast Practical Multi-Pattern Matching.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1999

On Approximability of the Minimum-Cost k-Connected Spanning Subgraph Problem.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Delayed Path Coupling and Generating Random Permutations via Distributed Stochastic Processes.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998

Time and Cost Trade-Offs in Gossiping.

[BibT_eX]

[DOI]

Leszek Gasieniec

Andrzej Pelc

SIAM J. Discret. Math., 1998

A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997

Sequential and Parallel Approximation of Shortest Superstrings.

[BibT_eX]

[DOI]

J. Algorithms, 1997

Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine.

[BibT_eX]

[DOI]

Dany Breslauer

Devdatt P. Dubhashi

Inf. Process. Lett., 1997

Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Architectures.

[BibT_eX]

[DOI]

Inf. Comput., 1997

The Architecture of a Software Library for String Processing.

[BibT_eX]

Proceedings of the Workshop on Algorithm Engineering, 1997

Routing on the PADAM: Degrees of Optimality.

[BibT_eX]

[DOI]

Bogdan S. Chlebus

Jop F. Sibeyn

Proceedings of the Euro-Par '97 Parallel Processing, 1997

Bounded Degree Spanning Trees (Extended Abstract).

[BibT_eX]

[DOI]

Willy-Bernhard Strothmann

Proceedings of the Algorithms, 1997

1996

Fast Generation of Random Permutations via Networks Simulation

[BibT_eX]

Universität Trier, Mathematik/Informatik, Forschungsbericht, 1996

Guthrie's Problem: New Equivalences and Rapid Reductions.

[BibT_eX]

[DOI]

Alan Gibbons

Theor. Comput. Sci., 1996

Very Fast Approximation of the Matrix Chain Product Problem.

[BibT_eX]

[DOI]

J. Algorithms, 1996

Parallel Maximum Independent Set in Convex Bipartite Graphs.

[BibT_eX]

[DOI]

Krzysztof Diks

Teresa M. Przytycka

Inf. Process. Lett., 1996

Parallel Alternating-Direction Access Machine.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

1995

Parallel Algorithmic Techniques: PRAM algorithms and PRAM simulations.

[BibT_eX]

[DOI]

PhD thesis, 1995

Work-time-optimal parallel algorithms for string problems.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Improved Optimal Shared Memory Simulations, and the Power of Reconfiguration.

[BibT_eX]

[DOI]

Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995

Shared Memory Simulations with Triple-Logarithmic Delay.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1995

1994

Speeding Up Two String-Matching Algorithms.

[BibT_eX]

[DOI]

Algorithmica, 1994

Parallel and Sequential Approximations of Shortest Superstrings.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 1994

1993

Parallel Algorithm for the Matrix Chain Product and the Optimal Triangulation Problems (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the STACS 93, 1993

Problems on Pairs of Trees and the Four Colour Problem of Planar Graphs.

[BibT_eX]

[DOI]

Alan Gibbons

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.

[BibT_eX]

[DOI]