Piotr Berman

180 papers A* 28A 7B 20C 5Misc 2Journal 85Unranked 33
YearRankTypeTitle / Venue / Authors
2024 J jnl
Testing Connectedness of Images.
Algorithmica
Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova, Dragos-Florian Ristache
2023 A conf
Testing Connectedness of Images.
APPROX/RANDOM
Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova, Dragos Ristache
2023 J jnl
Testing Connectedness of Images.
CoRR
Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova, Dragos-Florian Ristache
2022 J jnl
Tolerant Testers of Image Properties.
ACM Trans. Algorithms
Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova
2019 J jnl
Testing convexity of figures under the uniform distribution.
Random Struct. Algorithms
Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova
2019 J jnl
The Power and Limitations of Uniform Samples in Testing Properties of Figures.
Algorithmica
Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova
2016 A* conf
Testing Convexity of Figures Under the Uniform Distribution.
SoCG
Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova
2016 — conf
The Power and Limitations of Uniform Samples in Testing Properties of Figures.
FSTTCS
Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova
2016 A* conf
Tolerant Testers of Image Properties.
ICALP
Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova
2015 J jnl
Constant-Time Testing and Learning of Image Properties.
CoRR
Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova
2015 J jnl
The Distributed Selection Problem and the AKS Sorting Network.
CoRR
Piotr Berman, Junichiro Fukuyama
2014 J jnl
Approximation Algorithms for Min-Max Generalization Problems.
ACM Trans. Algorithms
Piotr Berman, Sofya Raskhodnikova
2014 J jnl
HybridPlan: a capacity planning technique for projecting storage requirements in hybrid storage systems.
J. Supercomput.
Youngjae Kim, Aayush Gupta, Bhuvan Urgaonkar, Piotr Berman, Anand Sivasubramaniam
2014 A* conf
L
STOC
Piotr Berman, Sofya Raskhodnikova, Grigory Yaroslavtsev
2014 J jnl
On the Computational Complexity of Measuring Global Stability of Banking Networks.
Algorithmica
Piotr Berman, Bhaskar DasGupta, Lakshmi Kaligounder, Marek Karpinski
2014 J jnl
Steiner transitive-closure spanners of low-dimensional posets.
Comb.
Piotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Grigory Yaroslavtsev
2013 J jnl
Approximation algorithms for spanner problems and Directed Steiner Forest.
Inf. Comput.
Piotr Berman, Arnab Bhattacharyya, Konstantin Makarychev, Sofya Raskhodnikova, Grigory Yaroslavtsev
2012 J jnl
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems.
Algorithmica
Piotr Berman, Marek Karpinski, Andrzej Lingas
2012 — conf
Improving the performance of k-means clustering through computation skipping and data locality optimizations.
Conf. Computing Frontiers
Orhan Kislal, Piotr Berman, Mahmut T. Kandemir
2012 — conf
Primal-Dual Approximation Algorithms for Node-Weighted Network Design in Planar Graphs.
APPROX-RANDOM
Piotr Berman, Grigory Yaroslavtsev
2011 J jnl
Approximating the Online Set Multicover Problems Via Randomized Winnowing
CoRR
Piotr Berman, Bhaskar DasGupta
2011 B conf
HybridStore: A Cost-Efficient, High-Performance Storage System Combining SSDs and HDDs.
MASCOTS
Youngjae Kim, Aayush Gupta, Bhuvan Urgaonkar, Piotr Berman, Anand Sivasubramaniam
2011 — conf
Improved Approximation for the Directed Spanner Problem.
ICALP (1)
Piotr Berman, Arnab Bhattacharyya, Konstantin Makarychev, Sofya Raskhodnikova, Grigory Yaroslavtsev
2011 — conf
O(1)-Approximations for Maximum Movement Problems.
APPROX-RANDOM
Piotr Berman, Erik D. Demaine, Morteza Zadimoghaddam
2011 J jnl
On Approximating Four Covering and Packing Problems
CoRR
Mary V. Ashley, Tanya Y. Berger-Wolf, Piotr Berman, Wanpracha Art Chaovalitwongse, Bhaskar DasGupta, Ming-Yang Kao
2011 J jnl
On Systemic Stability of Banking Networks
CoRR
Piotr Berman, Bhaskar DasGupta, Lakshmi Kaligounder, Marek Karpinski
2011 J jnl
Optimizing sensor movement planning for energy efficiency.
ACM Trans. Sens. Networks
Guiling Wang, Mary Jane Irwin, Haoying Fu, Piotr Berman, Wensheng Zhang, Tom La Porta
2011 — conf
Steiner Transitive-Closure Spanners of Low-Dimensional Posets.
ICALP (1)
Piotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Grigory Yaroslavtsev
2010 — conf
A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2.
ISAAC (1)
Piotr Berman, Marek Karpinski, Alexander Zelikovsky
2010 — conf
Approximation Algorithms for Min-Max Generalization Problems.
APPROX-RANDOM
Piotr Berman, Sofya Raskhodnikova
2010 — conf
Efficient Alignments of Metabolic Networks with Bounded Treewidth.
ICDM Workshops
Qiong Cheng, Piotr Berman, Robert W. Harrison, Alexander Zelikovsky
2010 Misc conf
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems.
COCOON
Piotr Berman, Marek Karpinski, Andrzej Lingas
2010 — conf
Finding Sparser Directed Spanners.
FSTTCS
Piotr Berman, Sofya Raskhodnikova, Ge Ruan
2010 J jnl
Steiner Transitive-Closure Spanners of d-Dimensional Posets
CoRR
Piotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Grigory Yaroslavtsev
2010 — conf
Successes and Failures of Elegant Algorithms in Computational Biology.
ISBRA
Piotr Berman
2009 B conf
1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2.
WADS
Piotr Berman, Marek Karpinski, Alexander Zelikovsky
2009 — conf
Aligning Two Genomic Sequences That Contain Duplications.
RECOMB-CG
Minmei Hou, Cathy Riemer, Piotr Berman, Ross C. Hardison, Webb Miller
2009 B conf
Approximating Transitive Reductions for Directed Networks.
WADS
Piotr Berman, Bhaskar DasGupta, Marek Karpinski
2009 J jnl
Consistent Sets of Secondary Structures in Proteins.
Algorithmica
Piotr Berman, Jieun K. Jeong
2009 J jnl
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems with Applications
CoRR
Piotr Berman, Marek Karpinski, Andrzej Lingas
2009 J jnl
On approximating four covering and packing problems.
J. Comput. Syst. Sci.
Mary V. Ashley, Tanya Y. Berger-Wolf, Piotr Berman, Wanpracha Art Chaovalitwongse, Bhaskar DasGupta, Ming-Yang Kao
2008 J jnl
1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two
CoRR
Piotr Berman, Marek Karpinski, Alexander Zelikovsky
2008 J jnl
1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two.
Electron. Colloquium Comput. Complex.
Piotr Berman, Marek Karpinski, Alexander Zelikovsky
2008 J jnl
A Factor 3/2 Approximation for Generalized Steiner Tree Problem with Distances One and Two
CoRR
Piotr Berman, Marek Karpinski, Alexander Zelikovsky
2008 J jnl
Approximating Transitivity in Directed Networks
CoRR
Piotr Berman, Bhaskar DasGupta, Marek Karpinski
2008 J jnl
Approximating the online set multicover problems via randomized winnowing.
Theor. Comput. Sci.
Piotr Berman, Bhaskar DasGupta
2008 — conf
Fast Alignments of Metabolic Networks.
BIBM
Qiong Cheng, Piotr Berman, Robert W. Harrison, Alexander Zelikovsky
2008 — conf
HCV Quasispecies Assembly Using Network Flows.
ISBRA
Kelly Westbrooks, Irina Astrovskaya, David S. Campo, Yuri Khudyakov, Piotr Berman, Alexander Zelikovsky
2008 J jnl
Improving Strand Pairing Prediction through Exploring Folding Cooperativity.
IEEE ACM Trans. Comput. Biol. Bioinform.
Jieun K. Jeong, Piotr Berman, Teresa M. Przytycka
2008 J jnl
On cycles in the transcription network of Saccharomyces cerevisiae.
BMC Syst. Biol.
Jieun K. Jeong, Piotr Berman
2007 J jnl
Approximating Huffman codes in parallel.
J. Discrete Algorithms
Piotr Berman, Marek Karpinski, Yakov Nekrich
2007 J jnl
Approximating Transitive Reductions for Directed Networks.
Electron. Colloquium Comput. Complex.
Piotr Berman, Bhaskar DasGupta, Marek Karpinski
2007 J jnl
Approximating the Online Set Multicover Problems Via Randomized Winnowing.
Electron. Colloquium Comput. Complex.
Piotr Berman, Bhaskar DasGupta
2007 J jnl
Bidding Protocols for Deploying Mobile Sensors.
IEEE Trans. Mob. Comput.
Guiling Wang, Guohong Cao, Piotr Berman, Thomas F. La Porta
2007 C conf
Bringing Folding Pathways into Strand Pairing Prediction.
WABI
Jieun K. Jeong, Piotr Berman, Teresa M. Przytycka
2007 J jnl
Computational complexity of some restricted instances of 3-SAT.
Discret. Appl. Math.
Piotr Berman, Marek Karpinski, Alexander D. Scott
2007 B conf
Faster Approximation of Distances in Graphs.
WADS
Piotr Berman, Shiva Prasad Kasiviswanathan
2007 J jnl
Foreword.
Algorithmica
Piotr Berman, Bhaskar DasGupta, Jie Liang
2007 J jnl
HomologMiner: looking for homologous genomic groups in whole genomes.
Bioinform.
Minmei Hou, Piotr Berman, Chih-Hao Hsu, Robert S. Harris
2007 J jnl
On constructing an optimal consensus clustering from multiple clusterings.
Inf. Process. Lett.
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao, Jie Wang
2007 J jnl
Optimal trade-off for Merkle tree traversal.
Theor. Comput. Sci.
Piotr Berman, Marek Karpinski, Yakov Nekrich
2007 B conf
Packing to angles and sectors.
SPAA
Piotr Berman, Jieun K. Jeong, Shiva Prasad Kasiviswanathan, Bhuvan Urgaonkar
2007 J jnl
Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks.
Discret. Appl. Math.
Piotr Berman, Bhaskar DasGupta, Eduardo D. Sontag
2007 J jnl
The inverse protein folding problem on 2D and 3D lattices.
Discret. Appl. Math.
Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robert H. Sloan, György Turán, Yi Zhang
2006 A* conf
8/7-approximation algorithm for (1, 2)-TSP.
SODA
Piotr Berman, Marek Karpinski
2006 C conf
A Linear-Time Algorithm for Studying Genetic Variation.
WABI
Nikola Stojanovic, Piotr Berman
2006 Misc conf
Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees.
CSR
Piotr Berman, Martin Fürer, Alexander Zelikovsky
2006 C conf
Controlling Size When Aligning Multiple Genomic Sequences with Duplications.
WABI
Minmei Hou, Piotr Berman, Louxin Zhang, Webb Miller
2006 J jnl
Packing to angles and sectors.
Electron. Colloquium Comput. Complex.
Piotr Berman, Jieun K. Jeong, Shiva Prasad Kasiviswanathan, Bhuvan Urgaonkar
2005 J jnl
8/7-Approximation Algorithm for (1,2)-TSP
Electron. Colloquium Comput. Complex.
Piotr Berman, Marek Karpinski
2005 B conf
Approximating the Online Set Multicover Problems via Randomized Winnowing.
WADS
Piotr Berman, Bhaskar DasGupta
2005 B conf
On the Vehicle Routing Problem.
WADS
Piotr Berman, Surajit K. Das
2005 — conf
Optimal Trade-Off for Merkle Tree Traversal.
ICETE (Selected Papers)
Piotr Berman, Marek Karpinski, Yakov Nekrich
2005 A conf
Optimizing sensor movement planning for energy efficiency.
ISLPED
Guiling Wang, Mary Jane Irwin, Piotr Berman, Haoying Fu, Thomas F. La Porta
2005 J jnl
Tight approximability results for test set problems in bioinformatics.
J. Comput. Syst. Sci.
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
2004 J jnl
Computational Complexity of Some Restricted Instances of 3SAT
Electron. Colloquium Comput. Complex.
Piotr Berman, Marek Karpinski, Alexander D. Scott
2004 J jnl
Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search.
J. Comput. Biol.
Piotr Berman, Paul Bertone, Bhaskar DasGupta, Mark Gerstein, Ming-Yang Kao, Michael Snyder
2004 J jnl
Optimal Trade-Off for Merkle Tree Traversal
Electron. Colloquium Comput. Complex.
Piotr Berman, Marek Karpinski, Yakov Nekrich
2004 B conf
Power efficient monitoring management in sensor networks.
WCNC
Piotr Berman, Gruia Calinescu, C. Shah, Alexander Zelikovsky
2004 — conf
Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Networks.
APPROX-RANDOM
Piotr Berman, Bhaskar DasGupta, Eduardo D. Sontag
2004 B conf
The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices.
CPM
Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robert H. Sloan, György Turán, Yi Zhang
2004 — conf
Tight Approximability Results for Test Set Problems in Bioinformatics.
SWAT
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
2003 J jnl
Aligning two fragmented sequences.
Discret. Appl. Math.
Vamsi Veeramachaneni, Piotr Berman, Webb Miller
2003 J jnl
Approximability of Hypergraph Minimum Bisection.
Electron. Colloquium Comput. Complex.
Piotr Berman, Marek Karpinski
2003 J jnl
Approximation Hardness and Satisfiability of Bounded Occurrence Instances of SAT
Electron. Colloquium Comput. Complex.
Piotr Berman, Marek Karpinski, Alex D. Scott
2003 J jnl
Approximation Hardness of Short Symmetric Instances of MAX-3SAT.
Electron. Colloquium Comput. Complex.
Piotr Berman, Marek Karpinski, Alex D. Scott
2003 J jnl
Approximation algorithms for MAX-MIN tiling.
J. Algorithms
Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan
2003 J jnl
Improved Approximation Lower Bounds on Small Occurrence Optimization
Electron. Colloquium Comput. Complex.
Piotr Berman, Marek Karpinski
2003 A* conf
Optimizing misdirection.
SODA
Piotr Berman, Piotr Krysta
2002 A conf
1.375-Approximation Algorithm for Sorting by Reversals.
ESA
Piotr Berman, Sridhar Hannenhalli, Marek Karpinski
2002 A conf
Aligning Two Fragmented Sequences.
IPDPS
Vamsi Veeramachaneni, Piotr Berman, Webb Miller
2002 J jnl
Approximating Huffman Codes in Parallel
Electron. Colloquium Comput. Complex.
Piotr Berman, Marek Karpinski, Yakov Nekrich
2002 A* conf
Approximating Huffman Codes in Parallel.
ICALP
Piotr Berman, Marek Karpinski, Yakov Nekrich
2002 A* conf
Approximating minimum unsatisfiability of linear equations.
SODA
Piotr Berman, Marek Karpinski
2002 A* conf
Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION.
ICALP
Piotr Berman, Marek Karpinski
2002 J jnl
Exact Size of Binary Space Partitionings and Improved Rectangle Tiling Algorithms.
SIAM J. Discret. Math.
Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan
2002 C conf
Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search.
WABI
Piotr Berman, Paul Bertone, Bhaskar DasGupta, Mark Gerstein, Ming-Yang Kao, Michael Snyder
2002 J jnl
On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts.
J. Comput. Syst. Sci.
Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter
2002 A* conf
Simple approximation algorithm for nonoverlapping local alignments.
SODA
Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan
2002 A* conf
Slice and dice: a simple, improved approximate tiling recipe.
SODA
Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan
2001 J jnl
1.375-Approximation Algorithm for Sorting by Reversals
Electron. Colloquium Comput. Complex.
Piotr Berman, Sridhar Hannenhalli, Marek Karpinski
2001 — conf
An Online Algorithm for the Postman Problem with a Small Penalty.
RANDOM-APPROX
Piotr Berman, Junichiro Fukuyama
2001 J jnl
Approximating Minimum Unsatisfiability of Linear Equations
Electron. Colloquium Comput. Complex.
Piotr Berman, Marek Karpinski
2001 J jnl
Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION
Electron. Colloquium Comput. Complex.
Piotr Berman, Marek Karpinski
2001 J jnl
Efficient Amplifiers and Bounded Degree Optimization.
Electron. Colloquium Comput. Complex.
Piotr Berman, Marek Karpinski
2001 J jnl
Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles.
J. Algorithms
Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan, Suneeta Ramaswami
2001 J jnl
Improved Approximations for General Minimum Cost Scheduling
Electron. Colloquium Comput. Complex.
Piotr Berman, Marek Karpinski
2001 A* conf
Improved approximation algorithms for rectangle tiling and packing.
SODA
Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan, Suneeta Ramaswami
2001 J jnl
On the Complexity of Positional Sequencing by Hybridization
Electron. Colloquium Comput. Complex.
Piotr Berman, Amir Ben-Dor, Itsik Pe'er, Roded Sharan, Ron Shamir
2000 — conf
A
SWAT
Piotr Berman
2000 J jnl
A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs.
Nord. J. Comput.
Piotr Berman
2000 A* conf
Improvements in throughout maximization for real-time scheduling.
STOC
Piotr Berman, Bhaskar DasGupta
2000 J jnl
Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling.
J. Comb. Optim.
Piotr Berman, Bhaskar DasGupta
2000 J jnl
On-Line Load Balancing for Related Machines
Electron. Colloquium Comput. Complex.
Piotr Berman, Moses Charikar, Marek Karpinski
2000 J jnl
On-Line Load Balancing for Related Machines.
J. Algorithms
Piotr Berman, Moses Charikar, Marek Karpinski
2000 J jnl
Optimal phase conflict removal for layout of dark field alternatingphase shifting masks.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
Piotr Berman, Andrew B. Kahng, Devendra Vidhani, Huijuan Wang, Alexander Zelikovsky
2000 — conf
Variable length sequencing with two lengths.
APPROX
Piotr Berman, Junichiro Fukuyama
2000 J jnl
Winnowing Sequences from a Database Search.
J. Comput. Biol.
Piotr Berman, Zheng Zhang, Yuri I. Wolf, Eugene V. Koonin, Webb Miller
1999 J jnl
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem.
SIAM J. Discret. Math.
Vineet Bafna, Piotr Berman, Toshihiro Fujito
1999 J jnl
On Approximation Properties of the Independent Set Problem for Low Degree Graphs.
Theory Comput. Syst.
Piotr Berman, Toshihiro Fujito
1999 A* conf
On Some Tighter Inapproximability Results (Extended Abstract).
ICALP
Piotr Berman, Marek Karpinski
1999 — conf
Optimal phase conflict removal for layout of dark field alternating phase shifting masks.
ISPD
Piotr Berman, Andrew B. Kahng, Devendra Vidhani, Huijuan Wang, Alexander Zelikovsky
1999 J jnl
Post-processing long pairwise alignments.
Bioinform.
Zheng Zhang, Piotr Berman, Thomas Wiehe, Webb Miller
1999 J jnl
Speed is More Powerful than Clairvoyance.
Nord. J. Comput.
Piotr Berman, Chris Coulston
1999 B conf
The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout.
WADS
Piotr Berman, Andrew B. Kahng, Devendra Vidhani, Alexander Zelikovsky
1999 B conf
Winnowing sequences from a database search.
RECOMB
Piotr Berman, Zheng Zhang, Yuri I. Wolf, Eugene V. Koonin, Webb Miller
1998 A conf
Adaptability and the Usefulness of Hints (Extended Abstract).
ESA
Piotr Berman, Juan A. Garay
1998 J jnl
Alignments without Low-Scoring Regions.
J. Comput. Biol.
Zheng Zhang, Piotr Berman, Webb Miller
1998 B conf
Alignments without low-scoring regions.
RECOMB
Zheng Zhang, Piotr Berman, Webb Miller
1998 J jnl
On Some Tighter Inapproximability Results
Electron. Colloquium Comput. Complex.
Piotr Berman, Marek Karpinski
1998 J jnl
On Some Tighter Inapproximability Results, Further Improvements
Electron. Colloquium Comput. Complex.
Piotr Berman, Marek Karpinski
1998 — conf
Speed is More Powerful than Claivoyance.
SWAT
Piotr Berman, Chris Coulston
1997 B conf
A Linear-Time Algorithm for the 1-Mismatch Problem.
WADS
Nikola Stojanovic, Piotr Berman, Deborah Gumucio, Ross C. Hardison, Webb Miller
1997 J jnl
A Nearly Optimal Parallel Algorithm for the Voronoi Diagram of a Convex Polygon.
Theor. Comput. Sci.
Piotr Berman, Andrzej Lingas
1997 A* conf
Competing against Specialists.
PODC
Piotr Berman, Juan A. Garay
1997 J jnl
Complexities of Efficient Solutions of Rectilinear Polygon Cover Problems.
Algorithmica
Piotr Berman, Bhaskar DasGupta
1997 B conf
On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts.
CPM
Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter
1997 A* conf
On-Line Algorithms for Steiner Tree Problems (Extended Abstract).
STOC
Piotr Berman, Chris Coulston
1997 B conf
On-line Load Balancing for Related Machines.
WADS
Piotr Berman, Moses Charikar, Marek Karpinski
1997 J jnl
Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures.
J. Algorithms
Piotr Berman, Krzysztof Diks, Andrzej Pelc
1996 B conf
Fast Sorting by Reversal.
CPM
Piotr Berman, Sridhar Hannenhalli
1996 — conf
On-line Searching and Navigation.
Online Algorithms
Piotr Berman
1996 A* conf
Randomized Robot Navigation Algorithms.
SODA
Piotr Berman, Avrim Blum, Amos Fiat, Howard J. Karloff, Adi Rosén, Michael E. Saks
1995 B conf
Constant Ratio Approximations of the Weighted Feedback Vertex Set Problem for Undirected Graphs.
ISAAC
Vineet Bafna, Piotr Berman, Toshihiro Fujito
1995 B conf
On the Approximation Properties of Independent Set Problem in Degree 3 Graphs.
WADS
Piotr Berman, Toshihiro Fujito
1994 — conf
A Nearly Optimal Parallel Algorithm for the Voronoi Diagram of a Convex Polygon.
SWAT
Piotr Berman, Andrzej Lingas
1994 A conf
Approaching the 5/4-Approximation for Rectilinear Steiner Trees.
ESA
Piotr Berman, Ulrich Fößmeier, Marek Karpinski, Michael Kaufmann, Alexander Zelikovsky
1994 A* conf
Approximating Maximum Independent Set in Bounded Degree Graphs.
SODA
Piotr Berman, Martin Fürer
1994 J jnl
Improved Approximations for the Steiner Tree Problem.
J. Algorithms
Piotr Berman, Viswanathan Ramaiyer
1994 J jnl
Online Navigation in a Room.
J. Algorithms
Eldad Bar-Eli, Piotr Berman, Amos Fiat, Peiyuan Yan
1994 J jnl
Reliable distributed diagnosis for multiprocessor systems with random faults.
Networks
Piotr Berman, Andrzej Pelc
1994 J jnl
Voting as the Optimal Static Pessimistic Scheme for Managing Replicated Data.
IEEE Trans. Parallel Distributed Syst.
Mirjana Spasojevic, Piotr Berman
1993 J jnl
Cloture Votes: n/4-Resilient Distributed Consensus in t+1 Rounds.
Math. Syst. Theory
Piotr Berman, Juan A. Garay
1993 J jnl
Fast Consensus in Networks of Bounded Degree.
Distributed Comput.
Piotr Berman, Juan A. Garay
1993 — conf
Quick Atomic Broadcast (Extended Abstract).
WDAG
Piotr Berman, Anupam A. Bharali
1993 — conf
Randomized Distributed Agreement Revisited.
FTCS
Piotr Berman, Juan A. Garay
1992 J jnl
A note on the complexity of reliability in neural networks.
IEEE Trans. Neural Networks
Piotr Berman, Ian Parberry, Georg Schnitger
1992 — conf
Distributed Consensus in Semi-Synchronous Systems.
IPPS
Piotr Berman, Anupam A. Bharali
1992 A* conf
Improved Approximations for the Steiner Tree Problem.
SODA
Piotr Berman, Viswanathan Ramaiyer
1992 J jnl
On the Complexity of Approximating the Independent Set Problem
Inf. Comput.
Piotr Berman, Georg Schnitger
1992 A* conf
On-Line Navigation in a Room.
SODA
Eldad Bar-Eli, Piotr Berman, Amos Fiat, Peiyuan Yan
1992 — conf
Optimal Early Stopping in Distributed Consensus (Extended Abstract).
WDAG
Piotr Berman, Juan A. Garay, Kenneth J. Perry
1991 — conf
Efficient Distributed Consensus with n = (3 + epsilon) t Processors (Extended Abstract).
WDAG
Piotr Berman, Juan A. Garay
1990 A* conf
A Competitive 3-Server Algorithm.
SODA
Piotr Berman, Howard J. Karloff, Gábor Tardos
1990 — conf
Distributed probabilistic fault diagnosis for multiprocessor systems.
FTCS
Piotr Berman, Andrzej Pelc
1990 — conf
Fast Consensus in Networks of Bounded Degree (Extended Abstract).
WDAG
Piotr Berman, Juan A. Garay
1990 B conf
Voting as the Optimal Static Pessimistic Scheme for Managing Replicated Data.
SRDS
Mirjana Obradovic, Piotr Berman
1990 — conf
Weighted Voting for Operation Dependent Management of Replicated Data.
WDAG
Mirjana Obradovic, Piotr Berman
1989 A* conf
Asymptotically Optimal Distributed Consensus (Extended Abstract).
ICALP
Piotr Berman, Juan A. Garay
1989 — conf
Efficient Agreement on Bounded-Degree Networks.
ICPP (1)
Piotr Berman, Juan A. Garay
1989 A conf
On the Complexity of Approximating the Independent Set Problem.
STACS
Piotr Berman, Georg Schnitger
1989 A* conf
Towards Optimal Distributed Consensus (Extended Abstract)
FOCS
Piotr Berman, Juan A. Garay, Kenneth J. Perry
1988 A* conf
Investigations of Fault-Tolerant Networks of Computers (Preliminary Version)
STOC
Piotr Berman, Janos Simon
1987 C conf
A Learning Algorithm for a Class of Context-Free Languages (Extended Abstract).
ISMIS
Piotr Berman, Robert Roos
1987 A* conf
Learning One-Counter Languages in Polynomial Time (Extended Abstract)
FOCS
Piotr Berman, Robert Roos
1983 B conf
Deterministic Dynamic Logic of Recursive Programs is Weaker than Dynamic Logic.
FCT
Piotr Berman
1983 A* conf
Lower Bounds on Graph Threading by Probabilistic Machines (Preliminary Version)
FOCS
Piotr Berman, Janos Simon
1982 A* conf
On the Power of Nondeterminism in Dynamic Logic.
ICALP
Piotr Berman, Joseph Y. Halpern, Jerzy Tiuryn
1980 A* conf
A Note on Sweeping Automata.
ICALP
Piotr Berman
1978 A* conf
Relationship Between Density and Deterministic Complexity of NP-Complete Languages.
ICALP
Piotr Berman