Piotr Berman

From MaRDI portal
Person:397069



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Testing connectedness of images2025-01-14Paper
Testing connectedness of images
Algorithmica
2024-10-24Paper
Tolerant Testers of Image Properties
ACM Transactions on Algorithms
2023-10-31Paper
Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs2023-03-21Paper
On approximation properties of the Independent set problem for degree 3 graphs
Lecture Notes in Computer Science
2022-12-16Paper
A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon
Algorithm Theory — SWAT '94
2022-12-09Paper
Speed is more powerful than clairvoyance
Algorithm Theory — SWAT'98
2022-12-09Paper
A linear-time algorithm for the 1-mismatch problem
Lecture Notes in Computer Science
2022-08-19Paper
On-line load balancing for related machines
Lecture Notes in Computer Science
2022-08-19Paper
On the complexity of approximating the independent set problem (extended abstract)
STACS 89
2022-08-16Paper
Testing convexity of figures under the uniform distribution
Random Structures & Algorithms
2019-06-07Paper
The power and limitations of uniform samples in testing properties of figures
Algorithmica
2019-03-11Paper
Approximation algorithms for min-max generalization problems
ACM Transactions on Algorithms
2018-10-30Paper
The power and limitations of uniform samples in testing properties of figures2018-04-19Paper
Testing convexity of figures under the uniform distribution2018-01-30Paper
Tolerant testers of image properties
(available as arXiv preprint)
2017-12-19Paper
\(L_p\)-testing
Proceedings of the forty-sixth annual ACM symposium on Theory of computing
2015-06-26Paper
On the computational complexity of measuring global stability of banking networks
Algorithmica
2015-01-19Paper
Improvements in throughout maximization for real-time scheduling
Proceedings of the thirty-second annual ACM symposium on Theory of computing
2014-09-26Paper
Steiner transitive-closure spanners of low-dimensional posets
Combinatorica
2014-08-14Paper
Approximation algorithms for spanner problems and directed Steiner forest
Information and Computation
2013-06-06Paper
Exact and approximation algorithms for geometric and capacitated set cover problems
Algorithmica
2012-11-21Paper
Primal-dual approximation algorithms for node-weighted network design in planar graphs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
2012-11-02Paper
Finding sparser directed spanners2012-08-29Paper
\(O(1)\)-approximations for maximum movement problems
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
2011-08-17Paper
Improved approximation for the directed spanner problem
Automata, Languages and Programming
2011-07-06Paper
Steiner transitive-closure spanners of low-dimensional posets
Automata, Languages and Programming
2011-07-06Paper
A 3/2-approximation algorithm for generalized Steiner trees in complete graphs with edge lengths 1 and 2
Algorithms and Computation
2010-12-09Paper
Approximation algorithms for min-max generalization problems
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
2010-09-10Paper
8/7-approximation algorithm for (1,2)-TSP
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06
2010-08-16Paper
Exact and approximation algorithms for geometric and capacitated set cover problems
Lecture Notes in Computer Science
2010-07-20Paper
On constructing an optimal consensus clustering from multiple clusterings
Information Processing Letters
2010-03-24Paper
1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2
Lecture Notes in Computer Science
2009-10-20Paper
Approximating Transitive Reductions for Directed Networks
Lecture Notes in Computer Science
2009-10-20Paper
On approximating four covering and packing problems
Journal of Computer and System Sciences
2009-06-08Paper
Consistent sets of secondary structures in proteins
Algorithmica
2009-05-13Paper
Faster Approximation of Distances in Graphs
Lecture Notes in Computer Science
2009-02-17Paper
Approximating the online set multicover problems via randomized winnowing
Theoretical Computer Science
2008-04-15Paper
Approximating Huffman codes in parallel
Journal of Discrete Algorithms
2008-01-11Paper
Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees
Computer Science – Theory and Applications
2007-05-02Paper
Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks
Discrete Applied Mathematics
2007-04-18Paper
The inverse protein folding problem on 2D and 3D lattices
Discrete Applied Mathematics
2007-04-18Paper
Computational complexity of some restricted instances of 3-SAT
Discrete Applied Mathematics
2007-04-13Paper
Optimal trade-off for Merkle tree traversal
Theoretical Computer Science
2007-03-15Paper
Algorithms and Data Structures
Lecture Notes in Computer Science
2006-10-25Paper
Algorithms and Data Structures
Lecture Notes in Computer Science
2006-10-25Paper
Combinatorial Pattern Matching
Lecture Notes in Computer Science
2005-09-07Paper
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science
2005-09-07Paper
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science
2005-08-25Paper
Tight approximability results for test set problems in bioinformatics
Journal of Computer and System Sciences
2005-08-03Paper
scientific article; zbMATH DE number 2185598 (Why is no real title available?)2005-07-04Paper
scientific article; zbMATH DE number 2119705 (Why is no real title available?)2004-11-29Paper
scientific article; zbMATH DE number 2086657 (Why is no real title available?)2004-08-11Paper
scientific article; zbMATH DE number 2086676 (Why is no real title available?)2004-08-11Paper
scientific article; zbMATH DE number 2079339 (Why is no real title available?)2004-07-28Paper
scientific article; zbMATH DE number 1996311 (Why is no real title available?)2003-12-16Paper
scientific article; zbMATH DE number 1947393 (Why is no real title available?)2003-07-08Paper
scientific article; zbMATH DE number 1945181 (Why is no real title available?)2003-07-02Paper
On the complexity of pattern matching for highly compressed two-dimensional texts.
Journal of Computer and System Sciences
2003-05-14Paper
Aligning two fragmented sequences
Discrete Applied Mathematics
2003-04-28Paper
scientific article; zbMATH DE number 1833401 (Why is no real title available?)2002-11-21Paper
Efficient approximation algorithms for tiling and packing problems with rectangles
Journal of Algorithms
2002-07-08Paper
Exact size of binary space partitionings and improved rectangle tiling algorithms
SIAM Journal on Discrete Mathematics
2002-04-23Paper
Multi-phase algorithms for throughput maximization for real-time scheduling
Journal of Combinatorial Optimization
2002-04-23Paper
Improved approximation algorithms for rectangle tiling and packing.2002-01-30Paper
scientific article; zbMATH DE number 1670529 (Why is no real title available?)2001-11-11Paper
Algorithms for the least distance problem2001-09-18Paper
scientific article; zbMATH DE number 1617260 (Why is no real title available?)2001-07-11Paper
A \(d/2\) approximation for maximum weight independent set in \(d\)-claw free graphs
Nordic Journal of Computing
2001-04-17Paper
scientific article; zbMATH DE number 1559550 (Why is no real title available?)2001-02-28Paper
On-Line Load Balancing for Related Machines
Journal of Algorithms
2000-10-04Paper
scientific article; zbMATH DE number 1424548 (Why is no real title available?)2000-03-23Paper
scientific article; zbMATH DE number 1383710 (Why is no real title available?)2000-01-04Paper
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
SIAM Journal on Discrete Mathematics
1999-11-23Paper
On approximation properties of the independent set problem for low degree graphs
Theory of Computing Systems
1999-03-22Paper
A nearly parallel algorithm for the Voronoi diagram of a convex polygon
Theoretical Computer Science
1998-10-22Paper
scientific article; zbMATH DE number 1003268 (Why is no real title available?)1997-10-29Paper
Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures
Journal of Algorithms
1997-05-20Paper
scientific article; zbMATH DE number 871902 (Why is no real title available?)1996-10-21Paper
Online Navigation in a Room
Journal of Algorithms
1995-11-22Paper
Fast consensus in networks of bounded degree.
Distributed Computing
1995-11-22Paper
scientific article; zbMATH DE number 742979 (Why is no real title available?)1995-04-11Paper
Reliable distributed diagnosis for multiprocessor systems with random faults
Networks
1995-01-11Paper
Improved Approximations for the Steiner Tree Problem
Journal of Algorithms
1994-11-23Paper
scientific article; zbMATH DE number 432775 (Why is no real title available?)1994-09-19Paper
Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds
Mathematical Systems Theory
1993-04-01Paper
On the complexity of approximating the independent set problem
Information and Computation
1992-06-28Paper
On the Performance of the Minimum Degree Ordering for Gaussian Elimination
SIAM Journal on Matrix Analysis and Applications
1990-01-01Paper
scientific article; zbMATH DE number 3868597 (Why is no real title available?)1983-01-01Paper
scientific article; zbMATH DE number 3778723 (Why is no real title available?)1982-01-01Paper
scientific article; zbMATH DE number 3754072 (Why is no real title available?)1980-01-01Paper
scientific article; zbMATH DE number 3654096 (Why is no real title available?)1979-01-01Paper
scientific article; zbMATH DE number 3594673 (Why is no real title available?)1978-01-01Paper
scientific article; zbMATH DE number 3568031 (Why is no real title available?)1977-01-01Paper


Research outcomes over time


This page was built for person: Piotr Berman