default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPiotr Berman
Person information
- affiliation: Pennsylvania State University, University Park, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j53]Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova, Dragos-Florian Ristache:
Testing Connectedness of Images. Algorithmica 86(11): 3496-3517 (2024)- 2023
- [c95]Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova, Dragos Ristache:
Testing Connectedness of Images. APPROX/RANDOM 2023: 66:1-66:15 - [i32]Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova, Dragos-Florian Ristache:
Testing Connectedness of Images. CoRR abs/2312.03681 (2023) - 2022
- [j52]Piotr Berman
, Meiram Murzabulatov, Sofya Raskhodnikova:
Tolerant Testers of Image Properties. ACM Trans. Algorithms 18(4): 37:1-37:39 (2022)
2010 – 2019
- 2019
- [j51]Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova:
The Power and Limitations of Uniform Samples in Testing Properties of Figures. Algorithmica 81(3): 1247-1266 (2019) - [j50]Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova:
Testing convexity of figures under the uniform distribution. Random Struct. Algorithms 54(3): 413-443 (2019) - 2016
- [c94]Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova:
Testing Convexity of Figures Under the Uniform Distribution. SoCG 2016: 17:1-17:15 - [c93]Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova:
The Power and Limitations of Uniform Samples in Testing Properties of Figures. FSTTCS 2016: 45:1-45:14 - [c92]Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova:
Tolerant Testers of Image Properties. ICALP 2016: 90:1-90:14 - 2015
- [i31]Piotr Berman, Meiram Murzabulatov, Sofya Raskhodnikova:
Constant-Time Testing and Learning of Image Properties. CoRR abs/1503.01363 (2015) - [i30]Piotr Berman, Junichiro Fukuyama:
The Distributed Selection Problem and the AKS Sorting Network. CoRR abs/1511.00715 (2015) - 2014
- [j49]Piotr Berman, Bhaskar DasGupta, Lakshmi Kaligounder, Marek Karpinski:
On the Computational Complexity of Measuring Global Stability of Banking Networks. Algorithmica 70(4): 595-647 (2014) - [j48]Piotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Grigory Yaroslavtsev:
Steiner transitive-closure spanners of low-dimensional posets. Comb. 34(3): 255-277 (2014) - [j47]Piotr Berman, Sofya Raskhodnikova:
Approximation Algorithms for Min-Max Generalization Problems. ACM Trans. Algorithms 11(1): 5:1-5:23 (2014) - [j46]Youngjae Kim, Aayush Gupta, Bhuvan Urgaonkar, Piotr Berman, Anand Sivasubramaniam:
HybridPlan: a capacity planning technique for projecting storage requirements in hybrid storage systems. J. Supercomput. 67(1): 277-303 (2014) - [c91]Piotr Berman, Sofya Raskhodnikova, Grigory Yaroslavtsev:
Lp-testing. STOC 2014: 164-173 - 2013
- [j45]Piotr Berman, Arnab Bhattacharyya, Konstantin Makarychev, Sofya Raskhodnikova, Grigory Yaroslavtsev:
Approximation algorithms for spanner problems and Directed Steiner Forest. Inf. Comput. 222: 93-107 (2013) - 2012
- [j44]Piotr Berman, Marek Karpinski, Andrzej Lingas:
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems. Algorithmica 64(2): 295-310 (2012) - [c90]Piotr Berman, Grigory Yaroslavtsev:
Primal-Dual Approximation Algorithms for Node-Weighted Network Design in Planar Graphs. APPROX-RANDOM 2012: 50-60 - [c89]Orhan Kislal, Piotr Berman, Mahmut T. Kandemir:
Improving the performance of k-means clustering through computation skipping and data locality optimizations. Conf. Computing Frontiers 2012: 273-276 - 2011
- [j43]Guiling Wang, Mary Jane Irwin, Haoying Fu, Piotr Berman, Wensheng Zhang, Tom La Porta:
Optimizing sensor movement planning for energy efficiency. ACM Trans. Sens. Networks 7(4): 33:1-33:17 (2011) - [c88]Piotr Berman, Erik D. Demaine, Morteza Zadimoghaddam:
O(1)-Approximations for Maximum Movement Problems. APPROX-RANDOM 2011: 62-74 - [c87]Piotr Berman, Arnab Bhattacharyya, Konstantin Makarychev, Sofya Raskhodnikova, Grigory Yaroslavtsev:
Improved Approximation for the Directed Spanner Problem. ICALP (1) 2011: 1-12 - [c86]Piotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Grigory Yaroslavtsev:
Steiner Transitive-Closure Spanners of Low-Dimensional Posets. ICALP (1) 2011: 760-772 - [c85]Youngjae Kim, Aayush Gupta, Bhuvan Urgaonkar, Piotr Berman, Anand Sivasubramaniam:
HybridStore: A Cost-Efficient, High-Performance Storage System Combining SSDs and HDDs. MASCOTS 2011: 227-236 - [i29]Mary V. Ashley, Tanya Y. Berger-Wolf, Piotr Berman, Wanpracha Art Chaovalitwongse, Bhaskar DasGupta, Ming-Yang Kao:
On Approximating Four Covering and Packing Problems. CoRR abs/1102.1006 (2011) - [i28]Piotr Berman, Bhaskar DasGupta:
Approximating the Online Set Multicover Problems Via Randomized Winnowing. CoRR abs/1102.4005 (2011) - [i27]Piotr Berman, Bhaskar DasGupta, Lakshmi Kaligounder, Marek Karpinski:
On Systemic Stability of Banking Networks. CoRR abs/1110.3546 (2011) - 2010
- [c84]Piotr Berman, Sofya Raskhodnikova:
Approximation Algorithms for Min-Max Generalization Problems. APPROX-RANDOM 2010: 53-66 - [c83]Piotr Berman, Marek Karpinski, Andrzej Lingas:
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems. COCOON 2010: 226-234 - [c82]Piotr Berman, Sofya Raskhodnikova, Ge Ruan:
Finding Sparser Directed Spanners. FSTTCS 2010: 424-435 - [c81]Qiong Cheng, Piotr Berman, Robert W. Harrison, Alexander Zelikovsky:
Efficient Alignments of Metabolic Networks with Bounded Treewidth. ICDM Workshops 2010: 687-694 - [c80]Piotr Berman, Marek Karpinski, Alexander Zelikovsky:
A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2. ISAAC (1) 2010: 15-24 - [c79]Piotr Berman:
Successes and Failures of Elegant Algorithms in Computational Biology. ISBRA 2010: 2 - [i26]Piotr Berman, Arnab Bhattacharyya, Elena Grigorescu, Sofya Raskhodnikova, David P. Woodruff, Grigory Yaroslavtsev:
Steiner Transitive-Closure Spanners of d-Dimensional Posets. CoRR abs/1011.6100 (2010)
2000 – 2009
- 2009
- [j42]Piotr Berman, Jieun K. Jeong:
Consistent Sets of Secondary Structures in Proteins. Algorithmica 53(1): 16-34 (2009) - [j41]Mary V. Ashley, Tanya Y. Berger-Wolf, Piotr Berman, Wanpracha Art Chaovalitwongse, Bhaskar DasGupta, Ming-Yang Kao:
On approximating four covering and packing problems. J. Comput. Syst. Sci. 75(5): 287-302 (2009) - [c78]Minmei Hou, Cathy Riemer, Piotr Berman, Ross C. Hardison, Webb Miller:
Aligning Two Genomic Sequences That Contain Duplications. RECOMB-CG 2009: 98-110 - [c77]Piotr Berman, Bhaskar DasGupta, Marek Karpinski:
Approximating Transitive Reductions for Directed Networks. WADS 2009: 74-85 - [c76]Piotr Berman, Marek Karpinski, Alexander Zelikovsky:
1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2. WADS 2009: 86-97 - [i25]Piotr Berman, Marek Karpinski, Andrzej Lingas:
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems with Applications. CoRR abs/0904.2310 (2009) - 2008
- [j40]Jieun K. Jeong, Piotr Berman:
On cycles in the transcription network of Saccharomyces cerevisiae. BMC Syst. Biol. 2: 12 (2008) - [j39]Jieun K. Jeong, Piotr Berman, Teresa M. Przytycka:
Improving Strand Pairing Prediction through Exploring Folding Cooperativity. IEEE ACM Trans. Comput. Biol. Bioinform. 5(4): 484-491 (2008) - [j38]Piotr Berman, Bhaskar DasGupta:
Approximating the online set multicover problems via randomized winnowing. Theor. Comput. Sci. 393(1-3): 54-71 (2008) - [c75]Qiong Cheng, Piotr Berman, Robert W. Harrison, Alexander Zelikovsky:
Fast Alignments of Metabolic Networks. BIBM 2008: 147-152 - [c74]Kelly Westbrooks, Irina Astrovskaya, David S. Campo, Yuri Khudyakov, Piotr Berman, Alexander Zelikovsky:
HCV Quasispecies Assembly Using Network Flows. ISBRA 2008: 159-170 - [i24]Piotr Berman, Bhaskar DasGupta, Marek Karpinski:
Approximating Transitivity in Directed Networks. CoRR abs/0809.0188 (2008) - [i23]Piotr Berman, Marek Karpinski, Alexander Zelikovsky:
1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two. CoRR abs/0810.1851 (2008) - [i22]Piotr Berman, Marek Karpinski, Alexander Zelikovsky:
A Factor 3/2 Approximation for Generalized Steiner Tree Problem with Distances One and Two. CoRR abs/0812.2137 (2008) - [i21]Piotr Berman, Marek Karpinski, Alexander Zelikovsky:
1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [j37]Piotr Berman, Bhaskar DasGupta, Jie Liang:
Foreword. Algorithmica 48(4): 301 (2007) - [j36]Minmei Hou, Piotr Berman, Chih-Hao Hsu, Robert S. Harris:
HomologMiner: looking for homologous genomic groups in whole genomes. Bioinform. 23(8): 917-925 (2007) - [j35]Piotr Berman, Marek Karpinski, Alexander D. Scott:
Computational complexity of some restricted instances of 3-SAT. Discret. Appl. Math. 155(5): 649-653 (2007) - [j34]Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robert H. Sloan, György Turán, Yi Zhang:
The inverse protein folding problem on 2D and 3D lattices. Discret. Appl. Math. 155(6-7): 719-732 (2007) - [j33]Piotr Berman, Bhaskar DasGupta, Eduardo D. Sontag:
Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks. Discret. Appl. Math. 155(6-7): 733-749 (2007) - [j32]Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao, Jie Wang:
On constructing an optimal consensus clustering from multiple clusterings. Inf. Process. Lett. 104(4): 137-145 (2007) - [j31]Piotr Berman, Marek Karpinski, Yakov Nekrich:
Approximating Huffman codes in parallel. J. Discrete Algorithms 5(3): 479-490 (2007) - [j30]Piotr Berman, Marek Karpinski, Yakov Nekrich:
Optimal trade-off for Merkle tree traversal. Theor. Comput. Sci. 372(1): 26-36 (2007) - [j29]Guiling Wang, Guohong Cao, Piotr Berman, Thomas F. La Porta:
Bidding Protocols for Deploying Mobile Sensors. IEEE Trans. Mob. Comput. 6(5): 563-576 (2007) - [c73]Piotr Berman, Jieun K. Jeong, Shiva Prasad Kasiviswanathan, Bhuvan Urgaonkar:
Packing to angles and sectors. SPAA 2007: 171-180 - [c72]Jieun K. Jeong, Piotr Berman, Teresa M. Przytycka:
Bringing Folding Pathways into Strand Pairing Prediction. WABI 2007: 38-48 - [c71]Piotr Berman, Shiva Prasad Kasiviswanathan:
Faster Approximation of Distances in Graphs. WADS 2007: 541-552 - [i20]Piotr Berman, Bhaskar DasGupta:
Approximating the Online Set Multicover Problems Via Randomized Winnowing. Electron. Colloquium Comput. Complex. TR07 (2007) - [i19]Piotr Berman, Bhaskar DasGupta, Marek Karpinski:
Approximating Transitive Reductions for Directed Networks. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [c70]Piotr Berman, Martin Fürer, Alexander Zelikovsky:
Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees. CSR 2006: 70-79 - [c69]Piotr Berman, Marek Karpinski:
8/7-approximation algorithm for (1, 2)-TSP. SODA 2006: 641-648 - [c68]Minmei Hou, Piotr Berman, Louxin Zhang, Webb Miller:
Controlling Size When Aligning Multiple Genomic Sequences with Duplications. WABI 2006: 138-149 - [c67]Nikola Stojanovic, Piotr Berman:
A Linear-Time Algorithm for Studying Genetic Variation. WABI 2006: 344-354 - [i18]Piotr Berman, Jieun K. Jeong, Shiva Prasad Kasiviswanathan, Bhuvan Urgaonkar:
Packing to angles and sectors. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j28]Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao:
Tight approximability results for test set problems in bioinformatics. J. Comput. Syst. Sci. 71(2): 145-162 (2005) - [c66]Piotr Berman, Marek Karpinski, Yakov Nekrich:
Optimal Trade-Off for Merkle Tree Traversal. ICETE (Selected Papers) 2005: 150-162 - [c65]Guiling Wang, Mary Jane Irwin, Piotr Berman, Haoying Fu, Thomas F. La Porta:
Optimizing sensor movement planning for energy efficiency. ISLPED 2005: 215-220 - [c64]Piotr Berman, Bhaskar DasGupta:
Approximating the Online Set Multicover Problems via Randomized Winnowing. WADS 2005: 110-121 - [c63]Piotr Berman, Surajit K. Das:
On the Vehicle Routing Problem. WADS 2005: 360-371 - [i17]Piotr Berman, Marek Karpinski:
8/7-Approximation Algorithm for (1,2)-TSP. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j27]Piotr Berman, Paul Bertone, Bhaskar DasGupta, Mark Gerstein, Ming-Yang Kao, Michael Snyder:
Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search. J. Comput. Biol. 11(4): 766-785 (2004) - [c62]Piotr Berman, Bhaskar DasGupta, Eduardo D. Sontag:
Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Networks. APPROX-RANDOM 2004: 39-50 - [c61]Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robert H. Sloan, György Turán, Yi Zhang:
The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices. CPM 2004: 244-253 - [c60]Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao:
Tight Approximability Results for Test Set Problems in Bioinformatics. SWAT 2004: 39-50 - [c59]Piotr Berman, Gruia Calinescu, C. Shah, Alexander Zelikovsky:
Power efficient monitoring management in sensor networks. WCNC 2004: 2329-2334 - [i16]Piotr Berman, Marek Karpinski, Yakov Nekrich:
Optimal Trade-Off for Merkle Tree Traversal. Electron. Colloquium Comput. Complex. TR04 (2004) - [i15]Piotr Berman, Marek Karpinski, Alexander D. Scott:
Computational Complexity of Some Restricted Instances of 3SAT. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j26]Vamsi Veeramachaneni, Piotr Berman, Webb Miller:
Aligning two fragmented sequences. Discret. Appl. Math. 127(1): 119-143 (2003) - [j25]Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan:
Approximation algorithms for MAX-MIN tiling. J. Algorithms 47(2): 122-134 (2003) - [c58]Piotr Berman, Piotr Krysta:
Optimizing misdirection. SODA 2003: 192-201 - [i14]Piotr Berman, Marek Karpinski:
Improved Approximation Lower Bounds on Small Occurrence Optimization. Electron. Colloquium Comput. Complex. TR03 (2003) - [i13]Piotr Berman, Marek Karpinski, Alex D. Scott:
Approximation Hardness and Satisfiability of Bounded Occurrence Instances of SAT. Electron. Colloquium Comput. Complex. TR03 (2003) - [i12]Piotr Berman, Marek Karpinski, Alex D. Scott:
Approximation Hardness of Short Symmetric Instances of MAX-3SAT. Electron. Colloquium Comput. Complex. TR03 (2003) - [i11]Piotr Berman, Marek Karpinski:
Approximability of Hypergraph Minimum Bisection. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [j24]Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter:
On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts. J. Comput. Syst. Sci. 65(2): 332-350 (2002) - [j23]Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan:
Exact Size of Binary Space Partitionings and Improved Rectangle Tiling Algorithms. SIAM J. Discret. Math. 15(2): 252-267 (2002) - [c57]Piotr Berman, Sridhar Hannenhalli, Marek Karpinski:
1.375-Approximation Algorithm for Sorting by Reversals. ESA 2002: 200-210 - [c56]Piotr Berman, Marek Karpinski:
Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION. ICALP 2002: 623-632 - [c55]Piotr Berman, Marek Karpinski, Yakov Nekrich:
Approximating Huffman Codes in Parallel. ICALP 2002: 845-855 - [c54]Vamsi Veeramachaneni, Piotr Berman, Webb Miller:
Aligning Two Fragmented Sequences. IPDPS 2002 - [c53]Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan:
Slice and dice: a simple, improved approximate tiling recipe. SODA 2002: 455-464 - [c52]Piotr Berman, Marek Karpinski:
Approximating minimum unsatisfiability of linear equations. SODA 2002: 514-516 - [c51]Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan:
Simple approximation algorithm for nonoverlapping local alignments. SODA 2002: 677-678 - [c50]Piotr Berman, Paul Bertone, Bhaskar DasGupta, Mark Gerstein, Ming-Yang Kao, Michael Snyder:
Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search. WABI 2002: 419-433 - [i10]Piotr Berman, Marek Karpinski, Yakov Nekrich:
Approximating Huffman Codes in Parallel. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [j22]Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan, Suneeta Ramaswami:
Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles. J. Algorithms 41(2): 443-470 (2001) - [c49]Piotr Berman, Junichiro Fukuyama:
An Online Algorithm for the Postman Problem with a Small Penalty. RANDOM-APPROX 2001: 48-54 - [c48]Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan, Suneeta Ramaswami:
Improved approximation algorithms for rectangle tiling and packing. SODA 2001: 427-436 - [i9]Piotr Berman, Marek Karpinski:
Approximating Minimum Unsatisfiability of Linear Equations. Electron. Colloquium Comput. Complex. TR01 (2001) - [i8]Piotr Berman, Marek Karpinski:
Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION. Electron. Colloquium Comput. Complex. TR01 (2001) - [i7]Piotr Berman, Sridhar Hannenhalli, Marek Karpinski:
1.375-Approximation Algorithm for Sorting by Reversals. Electron. Colloquium Comput. Complex. TR01 (2001) - [i6]Piotr Berman, Marek Karpinski:
Efficient Amplifiers and Bounded Degree Optimization. Electron. Colloquium Comput. Complex. TR01 (2001) - [i5]Piotr Berman, Amir Ben-Dor, Itsik Pe'er, Roded Sharan, Ron Shamir:
On the Complexity of Positional Sequencing by Hybridization. Electron. Colloquium Comput. Complex. TR01 (2001) - [i4]Piotr Berman, Marek Karpinski:
Improved Approximations for General Minimum Cost Scheduling. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [j21]Piotr Berman, Moses Charikar, Marek Karpinski:
On-Line Load Balancing for Related Machines. J. Algorithms 35(1): 108-121 (2000) - [j20]Piotr Berman, Zheng Zhang, Yuri I. Wolf, Eugene V. Koonin, Webb Miller:
Winnowing Sequences from a Database Search. J. Comput. Biol. 7(1-2): 293-302 (2000) - [j19]Piotr Berman, Bhaskar DasGupta:
Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling. J. Comb. Optim. 4(3): 307-323 (2000) - [j18]Piotr Berman:
A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs. Nord. J. Comput. 7(3): 178-184 (2000) - [j17]Piotr Berman, Andrew B. Kahng, Devendra Vidhani, Huijuan Wang, Alexander Zelikovsky:
Optimal phase conflict removal for layout of dark field alternatingphase shifting masks. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 19(2): 175-187 (2000) - [c47]Piotr Berman, Junichiro Fukuyama:
Variable length sequencing with two lengths. APPROX 2000: 51-59 - [c46]Piotr Berman, Bhaskar DasGupta:
Improvements in throughout maximization for real-time scheduling. STOC 2000: 680-687 - [c45]Piotr Berman:
A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs. SWAT 2000: 214-219 - [i3]Piotr Berman, Moses Charikar, Marek Karpinski:
On-Line Load Balancing for Related Machines. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [j16]Zheng Zhang, Piotr Berman, Thomas Wiehe, Webb Miller:
Post-processing long pairwise alignments. Bioinform. 15(12): 1012-1019 (1999) - [j15]Piotr Berman, Toshihiro Fujito:
On Approximation Properties of the Independent Set Problem for Low Degree Graphs. Theory Comput. Syst. 32(2): 115-132 (1999) - [j14]Piotr Berman, Chris Coulston:
Speed is More Powerful than Clairvoyance. Nord. J. Comput. 6(2): 181-193 (1999) - [j13]Vineet Bafna, Piotr Berman, Toshihiro Fujito:
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem. SIAM J. Discret. Math. 12(3): 289-297 (1999) - [c44]Piotr Berman, Marek Karpinski:
On Some Tighter Inapproximability Results (Extended Abstract). ICALP 1999: 200-209 - [c43]Piotr Berman, Andrew B. Kahng, Devendra Vidhani, Huijuan Wang, Alexander Zelikovsky:
Optimal phase conflict removal for layout of dark field alternating phase shifting masks. ISPD 1999: 121-126 - [c42]Piotr Berman, Zheng Zhang, Yuri I. Wolf, Eugene V. Koonin, Webb Miller:
Winnowing sequences from a database search. RECOMB 1999: 50-58 - [c41]Piotr Berman, Andrew B. Kahng, Devendra Vidhani, Alexander Zelikovsky:
The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout. WADS 1999: 25-36 - 1998
- [j12]Zheng Zhang, Piotr Berman, Webb Miller:
Alignments without Low-Scoring Regions. J. Comput. Biol. 5(2): 197-210 (1998) - [c40]Piotr Berman, Juan A. Garay:
Adaptability and the Usefulness of Hints (Extended Abstract). ESA 1998: 271-282 - [c39]Zheng Zhang, Piotr Berman, Webb Miller:
Alignments without low-scoring regions. RECOMB 1998: 294-301 - [c38]Piotr Berman, Chris Coulston:
Speed is More Powerful than Claivoyance. SWAT 1998: 255-263 - [i2]Piotr Berman, Marek Karpinski:
On Some Tighter Inapproximability Results. Electron. Colloquium Comput. Complex. TR98 (1998) - [i1]Piotr Berman, Marek Karpinski:
On Some Tighter Inapproximability Results, Further Improvements. Electron. Colloquium Comput. Complex. TR98 (1998) - 1997
- [j11]Piotr Berman, Bhaskar DasGupta:
Complexities of Efficient Solutions of Rectilinear Polygon Cover Problems. Algorithmica 17(4): 331-356 (1997) - [j10]Piotr Berman, Krzysztof Diks, Andrzej Pelc:
Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures. J. Algorithms 22(2): 199-211 (1997) - [j9]Piotr Berman, Andrzej Lingas:
A Nearly Optimal Parallel Algorithm for the Voronoi Diagram of a Convex Polygon. Theor. Comput. Sci. 174(1-2): 193-202 (1997) - [c37]Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter:
On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts. CPM 1997: 40-51 - [c36]Piotr Berman, Juan A. Garay:
Competing against Specialists. PODC 1997: 284 - [c35]Piotr Berman, Chris Coulston:
On-Line Algorithms for Steiner Tree Problems (Extended Abstract). STOC 1997: 344-353 - [c34]Piotr Berman, Moses Charikar, Marek Karpinski:
On-line Load Balancing for Related Machines. WADS 1997: 116-125 - [c33]Nikola Stojanovic, Piotr Berman, Deborah Gumucio, Ross C. Hardison, Webb Miller:
A Linear-Time Algorithm for the 1-Mismatch Problem. WADS 1997: 126-135 - 1996
- [c32]Piotr Berman, Sridhar Hannenhalli:
Fast Sorting by Reversal. CPM 1996: 168-185 - [c31]Piotr Berman:
On-line Searching and Navigation. Online Algorithms 1996: 232-241 - [c30]Piotr Berman, Avrim Blum, Amos Fiat, Howard J. Karloff, Adi Rosén, Michael E. Saks:
Randomized Robot Navigation Algorithms. SODA 1996: 75-84 - 1995
- [c29]Vineet Bafna, Piotr Berman, Toshihiro Fujito:
Constant Ratio Approximations of the Weighted Feedback Vertex Set Problem for Undirected Graphs. ISAAC 1995: 142-151 - [c28]Piotr Berman, Toshihiro Fujito:
On the Approximation Properties of Independent Set Problem in Degree 3 Graphs. WADS 1995: 449-460 - 1994
- [j8]Eldad Bar-Eli, Piotr Berman, Amos Fiat, Peiyuan Yan:
Online Navigation in a Room. J. Algorithms 17(3): 319-341 (1994) - [j7]Piotr Berman, Viswanathan Ramaiyer:
Improved Approximations for the Steiner Tree Problem. J. Algorithms 17(3): 381-408 (1994) - [j6]Piotr Berman, Andrzej Pelc:
Reliable distributed diagnosis for multiprocessor systems with random faults. Networks 24(8): 417-427 (1994) - [j5]Mirjana Spasojevic, Piotr Berman:
Voting as the Optimal Static Pessimistic Scheme for Managing Replicated Data. IEEE Trans. Parallel Distributed Syst. 5(1): 64-73 (1994) - [c27]Piotr Berman, Ulrich Fößmeier, Marek Karpinski, Michael Kaufmann, Alexander Zelikovsky:
Approaching the 5/4-Approximation for Rectilinear Steiner Trees. ESA 1994: 60-71 - [c26]Piotr Berman, Martin Fürer:
Approximating Maximum Independent Set in Bounded Degree Graphs. SODA 1994: 365-371 - [c25]Piotr Berman, Andrzej Lingas:
A Nearly Optimal Parallel Algorithm for the Voronoi Diagram of a Convex Polygon. SWAT 1994: 73-82 - 1993
- [j4]Piotr Berman, Juan A. Garay:
Fast Consensus in Networks of Bounded Degree. Distributed Comput. 7(2): 67-73 (1993) - [j3]Piotr Berman, Juan A. Garay:
Cloture Votes: n/4-Resilient Distributed Consensus in t+1 Rounds. Math. Syst. Theory 26(1): 3-19 (1993) - [c24]Piotr Berman, Juan A. Garay:
Randomized Distributed Agreement Revisited. FTCS 1993: 412-419 - [c23]Piotr Berman, Anupam A. Bharali:
Quick Atomic Broadcast (Extended Abstract). WDAG 1993: 189-203 - 1992
- [j2]Piotr Berman, Georg Schnitger:
On the Complexity of Approximating the Independent Set Problem. Inf. Comput. 96(1): 77-94 (1992) - [j1]Piotr Berman, Ian Parberry, Georg Schnitger:
A note on the complexity of reliability in neural networks. IEEE Trans. Neural Networks 3(6): 998-1002 (1992) - [c22]Piotr Berman, Anupam A. Bharali:
Distributed Consensus in Semi-Synchronous Systems. IPPS 1992: 632-635 - [c21]Eldad Bar-Eli, Piotr Berman, Amos Fiat, Peiyuan Yan:
On-Line Navigation in a Room. SODA 1992: 237-249 - [c20]Piotr Berman, Viswanathan Ramaiyer:
Improved Approximations for the Steiner Tree Problem. SODA 1992: 325-334 - [c19]Piotr Berman, Juan A. Garay, Kenneth J. Perry:
Optimal Early Stopping in Distributed Consensus (Extended Abstract). WDAG 1992: 221-237 - 1991
- [c18]Piotr Berman, Juan A. Garay:
Efficient Distributed Consensus with n = (3 + epsilon) t Processors (Extended Abstract). WDAG 1991: 129-142 - 1990
- [c17]Piotr Berman, Andrzej Pelc:
Distributed probabilistic fault diagnosis for multiprocessor systems. FTCS 1990: 340-346 - [c16]Piotr Berman, Howard J. Karloff, Gábor Tardos:
A Competitive 3-Server Algorithm. SODA 1990: 280-290 - [c15]Mirjana Obradovic, Piotr Berman:
Voting as the Optimal Static Pessimistic Scheme for Managing Replicated Data. SRDS 1990: 126-135 - [c14]Mirjana Obradovic, Piotr Berman:
Weighted Voting for Operation Dependent Management of Replicated Data. WDAG 1990: 263-276 - [c13]Piotr Berman, Juan A. Garay:
Fast Consensus in Networks of Bounded Degree (Extended Abstract). WDAG 1990: 321-333
1980 – 1989
- 1989
- [c12]Piotr Berman, Juan A. Garay, Kenneth J. Perry:
Towards Optimal Distributed Consensus (Extended Abstract). FOCS 1989: 410-415 - [c11]Piotr Berman, Juan A. Garay:
Asymptotically Optimal Distributed Consensus (Extended Abstract). ICALP 1989: 80-94 - [c10]Piotr Berman, Juan A. Garay:
Efficient Agreement on Bounded-Degree Networks. ICPP (1) 1989: 188-191 - [c9]Piotr Berman, Georg Schnitger:
On the Complexity of Approximating the Independent Set Problem. STACS 1989: 256-268 - 1988
- [c8]Piotr Berman, Janos Simon:
Investigations of Fault-Tolerant Networks of Computers (Preliminary Version). STOC 1988: 66-77 - 1987
- [c7]Piotr Berman, Robert Roos:
Learning One-Counter Languages in Polynomial Time (Extended Abstract). FOCS 1987: 61-67 - [c6]Piotr Berman, Robert Roos:
A Learning Algorithm for a Class of Context-Free Languages (Extended Abstract). ISMIS 1987: 317-324 - 1983
- [c5]Piotr Berman:
Deterministic Dynamic Logic of Recursive Programs is Weaker than Dynamic Logic. FCT 1983: 14-25 - [c4]Piotr Berman, Janos Simon:
Lower Bounds on Graph Threading by Probabilistic Machines (Preliminary Version). FOCS 1983: 304-311 - 1982
- [c3]Piotr Berman, Joseph Y. Halpern, Jerzy Tiuryn:
On the Power of Nondeterminism in Dynamic Logic. ICALP 1982: 48-60 - 1980
- [c2]Piotr Berman:
A Note on Sweeping Automata. ICALP 1980: 91-97
1970 – 1979
- 1978
- [c1]Piotr Berman:
Relationship Between Density and Deterministic Complexity of NP-Complete Languages. ICALP 1978: 63-71
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
