☰

Piotr Berman - Publications

Affiliations: 
Pennsylvania State University, State College, PA, United States 
Area:
Computer Science
Tree Info Similar researchers PubMed Report error

37 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2014 Berman P, Raskhodnikova S. Approximation Algorithms for Min-Max Generalization Problems Acm Transactions On Algorithms. 11: 5. DOI: 10.1145/2636920  0.371
2014 Berman P, Bhattacharyya A, Grigorescu E, Raskhodnikova S, Woodruff DP, Yaroslavtsev G. Steiner transitive-closure spanners of low-dimensional posets Combinatorica. 34: 255-277. DOI: 10.1007/S00493-014-2833-9  0.321
2013 Berman P, Bhattacharyya A, Makarychev K, Raskhodnikova S, Yaroslavtsev G. Approximation algorithms for spanner problems and Directed Steiner Forest Information and Computation. 222: 93-107. DOI: 10.1016/J.Ic.2012.10.007  0.401
2012 Berman P, Karpinski M, Lingas A. Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems Algorithmica. 64: 295-310. DOI: 10.1007/S00453-011-9591-5  0.361
2011 Wang G, Irwin MJ, Fu H, Berman P, Zhang W, Porta TL. Optimizing sensor movement planning for energy efficiency Acm Transactions On Sensor Networks. 7. DOI: 10.1145/1921621.1921627  0.414
2009 Ashley M, Berger-Wolf T, Berman P, Chaovalitwongse W, DasGupta B, Kao MY. On approximating four covering and packing problems Journal of Computer and System Sciences. 75: 287-302. DOI: 10.1016/J.Jcss.2009.01.002  0.393
2008 Berman P, DasGupta B. Approximating the online set multicover problems via randomized winnowing Theoretical Computer Science. 393: 54-71. DOI: 10.1016/J.Tcs.2007.10.047  0.413
2007 Berman P, Dasgupta B, Sontag E. Algorithmic issues in reverse engineering of protein and gene networks via the modular response analysis method. Annals of the New York Academy of Sciences. 1115: 132-41. PMID 17925351 DOI: 10.1196/Annals.1407.001  0.337
2007 Wang G, Cao G, Berman P, La Porta TF. Bidding protocols for deploying mobile sensors Ieee Transactions On Mobile Computing. 6: 515-528. DOI: 10.1109/Tmc.2007.1022  0.369
2007 Berman P, Karpinski M, Nekrich Y. Optimal trade-off for Merkle tree traversal Theoretical Computer Science. 372: 26-36. DOI: 10.1016/J.Tcs.2006.11.029  0.348
2007 Berman P, Karpinski M, Nekrich Y. Approximating Huffman codes in parallel Journal of Discrete Algorithms. 5: 479-490. DOI: 10.1016/J.Jda.2006.10.007  0.355
2007 Berman P, DasGupta B, Kao M, Wang J. On constructing an optimal consensus clustering from multiple clusterings Information Processing Letters. 104: 137-145. DOI: 10.1016/J.Ipl.2007.06.008  0.332
2007 Berman P, Karpinski M, Scott AD. Computational complexity of some restricted instances of 3-SAT Discrete Applied Mathematics. 155: 649-653. DOI: 10.1016/J.Dam.2006.07.009  0.344
2007 Berman P, DasGupta B, Mubayi D, Sloan R, Turán G, Zhang Y. The inverse protein folding problem on 2D and 3D lattices Discrete Applied Mathematics. 155: 719-732. DOI: 10.1016/J.Dam.2005.09.018  0.386
2007 Berman P, DasGupta B, Sontag E. Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks Discrete Applied Mathematics. 155: 733-749. DOI: 10.1016/J.Dam.2004.11.009  0.383
2005 Berman P, DasGupta B, Kao M. Tight approximability results for test set problems in bioinformatics Journal of Computer and System Sciences. 71: 145-162. DOI: 10.1016/J.Jcss.2005.02.001  0.349
2004 Berman P, Bertone P, Dasgupta B, Gerstein M, Kao MY, Snyder M. Fast optimal genome tiling with applications to microarray design and homology search. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 11: 766-85. PMID 15579244 DOI: 10.1089/Cmb.2004.11.766  0.405
2003 Berman P, DasGupta B, Muthukrishnan S. Approximation algorithms for MAX-MIN tiling Journal of Algorithms. 47: 122-134. DOI: 10.1016/S0196-6774(03)00015-4  0.391
2003 Veeramachaneni V, Berman P, Miller W. Aligning two fragmented sequences Discrete Applied Mathematics. 127: 119-143. DOI: 10.1016/S0166-218X(02)00289-5  0.32
2002 Berman P, Dasgupta B, Muthukrishnan S. Exact size of binary space partitionings and improved rectangle tiling algorithms Siam Journal On Discrete Mathematics. 15: 252-267. DOI: 10.1137/S0895480101384347  0.359
2002 Berman P, Karpinski M, Larmore LL, Plandowski W, Rytter W. On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts Journal of Computer and System Sciences. 65: 332-350. DOI: 10.1006/Jcss.2002.1852  0.33
2001 Berman P, DasGupta B, Muthukrishnan S, Ramaswami S. Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles Journal of Algorithms. 41: 443-470. DOI: 10.1006/Jagm.2001.1188  0.362
2000 Berman P, Zhang Z, Wolf YI, Koonin EV, Miller W. Winnowing sequences from a database search. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 7: 293-302. PMID 10890403 DOI: 10.1089/10665270050081531  0.407
2000 Berman P, Kahng AB, Vidhani D, Wang H, Zelikovsky A. Optimal phase conflict removal for layout of dark field alternating phase shifting masks Ieee Transactions On Computer-Aided Design of Integrated Circuits and Systems. 19: 175-187. DOI: 10.1109/43.828546  0.36
2000 Berman P, Dasgupta B. Multi-phase algorithms for throughput maximization for real-time scheduling Journal of Combinatorial Optimization. 4: 307-323. DOI: 10.1023/A:1009822211065  0.354
2000 Berman P, Fukuyama J. Variable length sequencing with two lengths Lecture Notes in Computer Science. 51-59. DOI: 10.1007/3-540-44436-X_7  0.605
2000 Berman P, Charikar M, Karpinski M. On-Line Load Balancing for Related Machines Journal of Algorithms. 35: 108-121. DOI: 10.1006/Jagm.1999.1070  0.347
1999 Zhang Z, Berman P, Wiehe T, Miller W. Post-processing long pairwise alignments Bioinformatics. 15: 1012-1019. PMID 10745991 DOI: 10.1093/Bioinformatics/15.12.1012  0.324
1999 Bafna V, Berman P, Fujito T. A 2-Approximation algorithm for the undirected feedback vertex set problem Siam Journal On Discrete Mathematics. 12: 289-297. DOI: 10.1137/S0895480196305124  0.4
1998 Zhang Z, Berman P, Miller W. Alignments without low-scoring regions. Journal of Computational Biology : a Journal of Computational Molecular Cell Biology. 5: 197-210. PMID 9672828 DOI: 10.1089/Cmb.1998.5.197  0.342
1997 Berman P, Lingas A. A nearly optimal parallel algorithm for the Voronoi diagram of a convex polygon Theoretical Computer Science. 174: 193-202. DOI: 10.1016/S0304-3975(96)00024-2  0.361
1997 Berman P, DasGupta B. Complexities of efficient solutions of rectilinear polygon cover problems Algorithmica. 17: 331-356. DOI: 10.1007/Bf02523677  0.363
1993 Berman P, Garay JA. Fast consensus in networks of bounded degree Distributed Computing. 7: 67-73. DOI: 10.1007/Bf02280836  0.361
1993 Berman P, Garay JA. Cloture votes: n/4-resilient distributed consensus in t+1 rounds Theory of Computing Systems \/ Mathematical Systems Theory. 26: 3-19. DOI: 10.1007/Bf01187072  0.333
1992 Berman P, Schnitger G. On the complexity of approximating the independent set problem Information & Computation. 96: 77-94. DOI: 10.1016/0890-5401(92)90056-L  0.366
1992 Berman P, Garay JA, Perry KJ. Bit optimal distributed consensus Computer Science. 313-321. DOI: 10.1007/978-1-4615-3422-8_27  0.345
1990 Berman P, Schnitger G. On the performance of the minimum degree ordering for Gaussian elimination Siam Journal On Matrix Analysis and Applications. 11: 83-88. DOI: 10.1137/0611005  0.319
Show low-probability matches.