Piotr Berman

From MaRDI portal
Person:397069

Available identifiers

zbMath Open berman.piotrMaRDI QIDQ397069

List of research outcomes

PublicationDate of PublicationType
Tolerant Testers of Image Properties2023-10-31Paper
On approximation properties of the Independent set problem for degree 3 graphs2022-12-16Paper
Speed is more powerful than clairvoyance2022-12-09Paper
A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon2022-12-09Paper
On-line load balancing for related machines2022-08-19Paper
A linear-time algorithm for the 1-mismatch problem2022-08-19Paper
On the complexity of approximating the independent set problem2022-08-16Paper
Testing convexity of figures under the uniform distribution2019-06-07Paper
The power and limitations of uniform samples in testing properties of figures2019-03-11Paper
Approximation Algorithms for Min-Max Generalization Problems2018-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 properties2017-12-19Paper
L p -testing2015-06-26Paper
On the computational complexity of measuring global stability of banking networks2015-01-19Paper
Improvements in throughout maximization for real-time scheduling2014-09-26Paper
Steiner transitive-closure spanners of low-dimensional posets2014-08-14Paper
Approximation algorithms for spanner problems and directed Steiner forest2013-06-06Paper
Exact and approximation algorithms for geometric and capacitated set cover problems2012-11-21Paper
Primal-Dual Approximation Algorithms for Node-Weighted Network Design in Planar Graphs2012-11-02Paper
Finding sparser directed spanners2012-08-29Paper
O(1)-Approximations for Maximum Movement Problems2011-08-17Paper
Improved Approximation for the Directed Spanner Problem2011-07-06Paper
Steiner Transitive-Closure Spanners of Low-Dimensional Posets2011-07-06Paper
A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 22010-12-09Paper
Approximation Algorithms for Min-Max Generalization Problems2010-09-10Paper
8/7-approximation algorithm for (1,2)-TSP2010-08-16Paper
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems2010-07-20Paper
On constructing an optimal consensus clustering from multiple clusterings2010-03-24Paper
Approximating Transitive Reductions for Directed Networks2009-10-20Paper
1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 22009-10-20Paper
On approximating four covering and packing problems2009-06-08Paper
Consistent sets of secondary structures in proteins2009-05-13Paper
Faster Approximation of Distances in Graphs2009-02-17Paper
Approximating the online set multicover problems via randomized winnowing2008-04-15Paper
Approximating Huffman codes in parallel2008-01-11Paper
Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees2007-05-02Paper
The inverse protein folding problem on 2D and 3D lattices2007-04-18Paper
Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks2007-04-18Paper
Computational complexity of some restricted instances of 3-SAT2007-04-13Paper
Optimal trade-off for Merkle tree traversal2007-03-15Paper
Algorithms and Data Structures2006-10-25Paper
Algorithms and Data Structures2006-10-25Paper
Combinatorial Pattern Matching2005-09-07Paper
Algorithm Theory - SWAT 20042005-09-07Paper
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques2005-08-25Paper
Tight approximability results for test set problems in bioinformatics2005-08-03Paper
https://portal.mardi4nfdi.de/entity/Q30247592005-07-04Paper
https://portal.mardi4nfdi.de/entity/Q48289762004-11-29Paper
https://portal.mardi4nfdi.de/entity/Q47371942004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q47372132004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44712942004-07-28Paper
https://portal.mardi4nfdi.de/entity/Q44322802003-12-16Paper
https://portal.mardi4nfdi.de/entity/Q44113592003-07-08Paper
https://portal.mardi4nfdi.de/entity/Q44101582003-07-02Paper
On the complexity of pattern matching for highly compressed two-dimensional texts.2003-05-14Paper
Aligning two fragmented sequences2003-04-28Paper
https://portal.mardi4nfdi.de/entity/Q47807822002-11-21Paper
Multi-phase algorithms for throughput maximization for real-time scheduling2002-04-23Paper
https://portal.mardi4nfdi.de/entity/Q27537262001-11-11Paper
https://portal.mardi4nfdi.de/entity/Q27439732001-09-18Paper
https://portal.mardi4nfdi.de/entity/Q27219802001-07-11Paper
https://portal.mardi4nfdi.de/entity/Q27082312001-04-17Paper
https://portal.mardi4nfdi.de/entity/Q45270002001-02-28Paper
On-Line Load Balancing for Related Machines2000-10-04Paper
https://portal.mardi4nfdi.de/entity/Q49457972000-03-23Paper
https://portal.mardi4nfdi.de/entity/Q47193342000-01-04Paper
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem1999-11-23Paper
On approximation properties of the independent set problem for low degree graphs1999-03-22Paper
A nearly parallel algorithm for the Voronoi diagram of a convex polygon1998-10-22Paper
https://portal.mardi4nfdi.de/entity/Q31288961997-10-29Paper
Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures1997-05-20Paper
https://portal.mardi4nfdi.de/entity/Q48751711996-10-21Paper
Fast consensus in networks of bounded degree.1995-11-22Paper
Online Navigation in a Room1995-11-22Paper
https://portal.mardi4nfdi.de/entity/Q47634181995-04-11Paper
Reliable distributed diagnosis for multiprocessor systems with random faults1995-01-11Paper
Improved Approximations for the Steiner Tree Problem1994-11-23Paper
https://portal.mardi4nfdi.de/entity/Q31389051994-09-19Paper
Cloture Votes:n/4-resilient Distributed Consensus int + 1 rounds1993-04-01Paper
On the complexity of approximating the independent set problem1992-06-28Paper
On the Performance of the Minimum Degree Ordering for Gaussian Elimination1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33349751983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39579271982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39385251980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38536071979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41604341978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41396891977-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Piotr Berman