dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Piotr Berman Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
156Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOrhan 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
155Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Erik D. Demaine, Morteza Zadimoghaddam: O(1)-Approximations for Maximum Movement Problems. APPROX-RANDOM 2011: 62-74
154Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Arnab Bhattacharyya, Konstantin Makarychev, Sofya Raskhodnikova, Grigory Yaroslavtsev: Improved Approximation for the Directed Spanner Problem. ICALP (1) 2011: 1-12
153Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr 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
152Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYoungjae 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
151Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMary 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)
150Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Bhaskar DasGupta: Approximating the Online Set Multicover Problems Via Randomized Winnowing CoRR abs/1102.4005: (2011)
149Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Bhaskar DasGupta, Lakshmi Kaligounder, Marek Karpinski: On Systemic Stability of Banking Networks CoRR abs/1110.3546: (2011)
148Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuiling Wang, Mary Jane Irwin, Haoying Fu, Piotr Berman, Wensheng Zhang, Tom La Porta: Optimizing sensor movement planning for energy efficiency. TOSN 7(4): 33 (2011)
2010
147Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Sofya Raskhodnikova: Approximation Algorithms for Min-Max Generalization Problems. APPROX-RANDOM 2010: 53-66
146Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Marek Karpinski, Andrzej Lingas: Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems. COCOON 2010: 226-234
145Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Sofya Raskhodnikova, Ge Ruan: Finding Sparser Directed Spanners. FSTTCS 2010: 424-435
144Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLQiong Cheng, Piotr Berman, Robert W. Harrison, Alexander Zelikovsky: Efficient Alignments of Metabolic Networks with Bounded Treewidth. ICDM Workshops 2010: 687-694
143Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr 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
142Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman: Successes and Failures of Elegant Algorithms in Computational Biology. ISBRA 2010: 2
141Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr 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)
2009
140Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMinmei Hou, Cathy Riemer, Piotr Berman, Ross C. Hardison, Webb Miller: Aligning Two Genomic Sequences That Contain Duplications. RECOMB-CG 2009: 98-110
139Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Bhaskar DasGupta, Marek Karpinski: Approximating Transitive Reductions for Directed Networks. WADS 2009: 74-85
138Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Marek Karpinski, Alexander Zelikovsky: 1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2. WADS 2009: 86-97
137Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Jieun K. Jeong: Consistent Sets of Secondary Structures in Proteins. Algorithmica 53(1): 16-34 (2009)
136Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Marek Karpinski, Andrzej Lingas: Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems with Applications CoRR abs/0904.2310: (2009)
135Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMary 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)
2008
134Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLQiong Cheng, Piotr Berman, Robert W. Harrison, Alexander Zelikovsky: Fast Alignments of Metabolic Networks. BIBM 2008: 147-152
133Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKelly Westbrooks, Irina Astrovskaya, David S. Campo, Yuri Khudyakov, Piotr Berman, Alexander Zelikovsky: HCV Quasispecies Assembly Using Network Flows. ISBRA 2008: 159-170
132Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Bhaskar DasGupta, Marek Karpinski: Approximating Transitivity in Directed Networks CoRR abs/0809.0188: (2008)
131Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Marek Karpinski, Alexander Zelikovsky: 1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two CoRR abs/0810.1851: (2008)
130Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr 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)
129Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Marek Karpinski, Alexander Zelikovsky: 1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two. Electronic Colloquium on Computational Complexity (ECCC) 15(094): (2008)
128Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJieun K. Jeong, Piotr Berman, Teresa M. Przytycka: Improving Strand Pairing Prediction through Exploring Folding Cooperativity. IEEE/ACM Trans. Comput. Biology Bioinform. 5(4): 484-491 (2008)
127Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Bhaskar DasGupta: Approximating the online set multicover problems via randomized winnowing. Theor. Comput. Sci. 393(1-3): 54-71 (2008)
2007
126Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Jieun K. Jeong, Shiva Prasad Kasiviswanathan, Bhuvan Urgaonkar: Packing to angles and sectors. SPAA 2007: 171-180
125Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJieun K. Jeong, Piotr Berman, Teresa M. Przytycka: Bringing Folding Pathways into Strand Pairing Prediction. WABI 2007: 38-48
124Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Shiva Prasad Kasiviswanathan: Faster Approximation of Distances in Graphs. WADS 2007: 541-552
123Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Bhaskar DasGupta, Jie Liang: Foreword. Algorithmica 48(4): 301 (2007)
122Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMinmei Hou, Piotr Berman, Chih-Hao Hsu, Robert S. Harris: HomologMiner: looking for homologous genomic groups in whole genomes. Bioinformatics 23(8): 917-925 (2007)
121Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Marek Karpinski, Alexander D. Scott: Computational complexity of some restricted instances of 3-SAT. Discrete Applied Mathematics 155(5): 649-653 (2007)
120Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robert H. Sloan, György Turán, Yi Zhang: The inverse protein folding problem on 2D and 3D lattices. Discrete Applied Mathematics 155(6-7): 719-732 (2007)
119Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Bhaskar DasGupta, Eduardo D. Sontag: Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks. Discrete Applied Mathematics 155(6-7): 733-749 (2007)
118Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Bhaskar DasGupta: Approximating the Online Set Multicover Problems Via Randomized Winnowing. Electronic Colloquium on Computational Complexity (ECCC) 14(092): (2007)
117Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Bhaskar DasGupta, Marek Karpinski: Approximating Transitive Reductions for Directed Networks. Electronic Colloquium on Computational Complexity (ECCC) 14(119): (2007)
116Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuiling Wang, Guohong Cao, Piotr Berman, Thomas F. La Porta: Bidding Protocols for Deploying Mobile Sensors. IEEE Trans. Mob. Comput. 6(5): 563-576 (2007)
115Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr 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)
114Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Marek Karpinski, Yakov Nekrich: Approximating Huffman codes in parallel. J. Discrete Algorithms 5(3): 479-490 (2007)
113Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Marek Karpinski, Yakov Nekrich: Optimal trade-off for Merkle tree traversal. Theor. Comput. Sci. 372(1): 26-36 (2007)
2006
112Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Martin Fürer, Alexander Zelikovsky: Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees. CSR 2006: 70-79
111Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Marek Karpinski: 8/7-approximation algorithm for (1, 2)-TSP. SODA 2006: 641-648
110Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMinmei Hou, Piotr Berman, Louxin Zhang, Webb Miller: Controlling Size When Aligning Multiple Genomic Sequences with Duplications. WABI 2006: 138-149
109Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNikola Stojanovic, Piotr Berman: A Linear-Time Algorithm for Studying Genetic Variation. WABI 2006: 344-354
108Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Jieun K. Jeong, Shiva Prasad Kasiviswanathan, Bhuvan Urgaonkar: Packing to angles and sectors. Electronic Colloquium on Computational Complexity (ECCC) 13(030): (2006)
2005
107Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGuiling Wang, Mary Jane Irwin, Piotr Berman, Haoying Fu, Thomas F. La Porta: Optimizing sensor movement planning for energy efficiency. ISLPED 2005: 215-220
106Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Bhaskar DasGupta: Approximating the Online Set Multicover Problems via Randomized Winnowing. WADS 2005: 110-121
105Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Surajit K. Das: On the Vehicle Routing Problem. WADS 2005: 360-371
104Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Marek Karpinski: 8/7-Approximation Algorithm for (1,2)-TSP Electronic Colloquium on Computational Complexity (ECCC)(069): (2005)
103Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Bhaskar DasGupta, Ming-Yang Kao: Tight approximability results for test set problems in bioinformatics. J. Comput. Syst. Sci. 71(2): 145-162 (2005)
2004
102Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr 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
101Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr 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
100Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Bhaskar DasGupta, Ming-Yang Kao: Tight Approximability Results for Test Set Problems in Bioinformatics. SWAT 2004: 39-50
99Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Marek Karpinski, Yakov Nekrich: Optimal Trade-Off for Merkle Tree Traversal Electronic Colloquium on Computational Complexity (ECCC)(049): (2004)
98Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Marek Karpinski, Alexander D. Scott: Computational Complexity of Some Restricted Instances of 3SAT Electronic Colloquium on Computational Complexity (ECCC)(111): (2004)
97Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Paul Bertone, Bhaskar DasGupta, Mark Gerstein, Ming-Yang Kao, Michael Snyder: Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search. Journal of Computational Biology 11(4): 766-785 (2004)
2003
96Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Piotr Krysta: Optimizing misdirection. SODA 2003: 192-201
95Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVamsi Veeramachaneni, Piotr Berman, Webb Miller: Aligning two fragmented sequences. Discrete Applied Mathematics 127(1): 119-143 (2003)
94Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Marek Karpinski: Improved Approximation Lower Bounds on Small Occurrence Optimization Electronic Colloquium on Computational Complexity (ECCC) 10(008): (2003)
93Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Marek Karpinski, Alex D. Scott: Approximation Hardness and Satisfiability of Bounded Occurrence Instances of SAT Electronic Colloquium on Computational Complexity (ECCC) 10(022): (2003)
92Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Marek Karpinski, Alex D. Scott: Approximation Hardness of Short Symmetric Instances of MAX-3SAT Electronic Colloquium on Computational Complexity (ECCC)(049): (2003)
91Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Marek Karpinski: Approximability of Hypergraph Minimum Bisection Electronic Colloquium on Computational Complexity (ECCC)(056): (2003)
90Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Bhaskar DasGupta, S. Muthukrishnan: Approximation algorithms for MAX-MIN tiling. J. Algorithms 47(2): 122-134 (2003)
2002
89Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Sridhar Hannenhalli, Marek Karpinski: 1.375-Approximation Algorithm for Sorting by Reversals. ESA 2002: 200-210
88Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Marek Karpinski: Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION. ICALP 2002: 623-632
87Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Marek Karpinski, Yakov Nekrich: Approximating Huffman Codes in Parallel. ICALP 2002: 845-855
86Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVamsi Veeramachaneni, Piotr Berman, Webb Miller: Aligning Two Fragmented Sequences. IPDPS 2002
85Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Bhaskar DasGupta, S. Muthukrishnan: Slice and dice: a simple, improved approximate tiling recipe. SODA 2002: 455-464
84Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Marek Karpinski: Approximating minimum unsatisfiability of linear equations. SODA 2002: 514-516
83Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Bhaskar DasGupta, S. Muthukrishnan: Simple approximation algorithm for nonoverlapping local alignments. SODA 2002: 677-678
82Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr 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
81Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Marek Karpinski, Yakov Nekrich: Approximating Huffman Codes in Parallel Electronic Colloquium on Computational Complexity (ECCC)(018): (2002)
80Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr 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)
79Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Bhaskar DasGupta, S. Muthukrishnan: Exact Size of Binary Space Partitionings and Improved Rectangle Tiling Algorithms. SIAM J. Discrete Math. 15(2): 252-267 (2002)
2001
78Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Junichiro Fukuyama: An Online Algorithm for the Postman Problem with a Small Penalty. RANDOM-APPROX 2001: 48-54
77Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Bhaskar DasGupta, S. Muthukrishnan, Suneeta Ramaswami: Improved approximation algorithms for rectangle tiling and packing. SODA 2001: 427-436
76Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Marek Karpinski: Improved Approximations for General Minimum Cost Scheduling Electronic Colloquium on Computational Complexity (ECCC)(097): (2001)
75Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Marek Karpinski: Approximating Minimum Unsatisfiability of Linear Equations Electronic Colloquium on Computational Complexity (ECCC) 8(25): (2001)
74Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Marek Karpinski: Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION Electronic Colloquium on Computational Complexity (ECCC) 8(26): (2001)
73Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Sridhar Hannenhalli, Marek Karpinski: 1.375-Approximation Algorithm for Sorting by Reversals Electronic Colloquium on Computational Complexity (ECCC) 8(47): (2001)
72Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Marek Karpinski: Efficient Amplifiers and Bounded Degree Optimization Electronic Colloquium on Computational Complexity (ECCC) 8(53): (2001)
71Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Amir Ben-Dor, Itsik Pe'er, Roded Sharan, Ron Shamir: On the Complexity of Positional Sequencing by Hybridization Electronic Colloquium on Computational Complexity (ECCC) 8(54): (2001)
70Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Bhaskar DasGupta, S. Muthukrishnan, Suneeta Ramaswami: Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles. J. Algorithms 41(2): 443-470 (2001)
2000
69Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Junichiro Fukuyama: Variable length sequencing with two lengths. APPROX 2000: 51-59
68Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Bhaskar DasGupta: Improvements in throughout maximization for real-time scheduling. STOC 2000: 680-687
67Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman: A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs. SWAT 2000: 214-219
66Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Moses Charikar, Marek Karpinski: On-Line Load Balancing for Related Machines Electronic Colloquium on Computational Complexity (ECCC) 7(1): (2000)
65Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Andrew B. Kahng, Devendra Vidhani, Huijuan Wang, Alexander Zelikovsky: Optimal phase conflict removal for layout of dark field alternatingphase shifting masks. IEEE Trans. on CAD of Integrated Circuits and Systems 19(2): 175-187 (2000)
64Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Moses Charikar, Marek Karpinski: On-Line Load Balancing for Related Machines. J. Algorithms 35(1): 108-121 (2000)
63Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Bhaskar DasGupta: Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling. J. Comb. Optim. 4(3): 307-323 (2000)
62no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Zheng Zhang, Yuri I. Wolf, Eugene V. Koonin, Webb Miller: Winnowing Sequences from a Database Search. Journal of Computational Biology 7(1-2): 293-302 (2000)
61no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman: A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs. Nord. J. Comput. 7(3): 178-184 (2000)
1999
60Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Marek Karpinski: On Some Tighter Inapproximability Results (Extended Abstract). ICALP 1999: 200-209
59Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr 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
58Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Zheng Zhang, Yuri I. Wolf, Eugene V. Koonin, Webb Miller: Winnowing sequences from a database search. RECOMB 1999: 50-58
57Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr 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
56Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZheng Zhang, Piotr Berman, Thomas Wiehe, Webb Miller: Post-processing long pairwise alignments. Bioinformatics 15(12): 1012-1019 (1999)
55no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Chris Coulston: Speed is More Powerful than Clairvoyance. Nord. J. Comput. 6(2): 181-193 (1999)
54Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVineet Bafna, Piotr Berman, Toshihiro Fujito: A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem. SIAM J. Discrete Math. 12(3): 289-297 (1999)
53Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Toshihiro Fujito: On Approximation Properties of the Independent Set Problem for Low Degree Graphs. Theory Comput. Syst. 32(2): 115-132 (1999)
1998
52Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Juan A. Garay: Adaptability and the Usefulness of Hints (Extended Abstract). ESA 1998: 271-282
51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZheng Zhang, Piotr Berman, Webb Miller: Alignments without low-scoring regions. RECOMB 1998: 294-301
50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Chris Coulston: Speed is More Powerful than Claivoyance. SWAT 1998: 255-263
49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Marek Karpinski: On Some Tighter Inapproximability Results Electronic Colloquium on Computational Complexity (ECCC) 5(29): (1998)
48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Marek Karpinski: On Some Tighter Inapproximability Results, Further Improvements Electronic Colloquium on Computational Complexity (ECCC) 5(65): (1998)
47no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZheng Zhang, Piotr Berman, Webb Miller: Alignments without Low-Scoring Regions. Journal of Computational Biology 5(2): 197-210 (1998)
1997
46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr 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
45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Juan A. Garay: Competing against Specialists. PODC 1997: 284
44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Chris Coulston: On-Line Algorithms for Steiner Tree Problems (Extended Abstract). STOC 1997: 344-353
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Moses Charikar, Marek Karpinski: On-line Load Balancing for Related Machines. WADS 1997: 116-125
42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNikola Stojanovic, Piotr Berman, Deborah Gumucio, Ross C. Hardison, Webb Miller: A Linear-Time Algorithm for the 1-Mismatch Problem. WADS 1997: 126-135
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Bhaskar DasGupta: Complexities of Efficient Solutions of Rectilinear Polygon Cover Problems. Algorithmica 17(4): 331-356 (1997)
40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Krzysztof Diks, Andrzej Pelc: Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures. J. Algorithms 22(2): 199-211 (1997)
39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr 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)
1996
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Sridhar Hannenhalli: Fast Sorting by Reversal. CPM 1996: 168-185
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman: On-line Searching and Navigation. Online Algorithms 1996: 232-241
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Avrim Blum, Amos Fiat, Howard J. Karloff, Adi Rosén, Michael E. Saks: Randomized Robot Navigation Algorithms. SODA 1996: 75-84
1995
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLVineet Bafna, Piotr Berman, Toshihiro Fujito: Constant Ratio Approximations of the Weighted Feedback Vertex Set Problem for Undirected Graphs. ISAAC 1995: 142-151
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Toshihiro Fujito: On the Approximation Properties of Independent Set Problem in Degree 3 Graphs. WADS 1995: 449-460
1994
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Ulrich Fößmeier, Marek Karpinski, Michael Kaufmann, Alexander Zelikovsky: Approaching the 5/4-Approximation for Rectilinear Steiner Trees. ESA 1994: 60-71
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Martin Fürer: Approximating Maximum Independent Set in Bounded Degree Graphs. SODA 1994: 365-371
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Andrzej Lingas: A Nearly Optimal Parallel Algorithm for the Voronoi Diagram of a Convex Polygon. SWAT 1994: 73-82
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMirjana Spasojevic, Piotr Berman: Voting as the Optimal Static Pessimistic Scheme for Managing Replicated Data. IEEE Trans. Parallel Distrib. Syst. 5(1): 64-73 (1994)
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEldad Bar-Eli, Piotr Berman, Amos Fiat, Peiyuan Yan: Online Navigation in a Room. J. Algorithms 17(3): 319-341 (1994)
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Viswanathan Ramaiyer: Improved Approximations for the Steiner Tree Problem. J. Algorithms 17(3): 381-408 (1994)
1993
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Juan A. Garay: Randomized Distributed Agreement Revisited. FTCS 1993: 412-419
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Anupam A. Bharali: Quick Atomic Broadcast (Extended Abstract). WDAG 1993: 189-203
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Juan A. Garay: Fast Consensus in Networks of Bounded Degree. Distributed Computing 7(2): 67-73 (1993)
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Juan A. Garay: Cloture Votes: n/4-Resilient Distributed Consensus in t+1 Rounds. Mathematical Systems Theory 26(1): 3-19 (1993)
1992
23no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Anupam A. Bharali: Distributed Consensus in Semi-Synchronous Systems. IPPS 1992: 632-635
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEldad Bar-Eli, Piotr Berman, Amos Fiat, Peiyuan Yan: On-Line Navigation in a Room. SODA 1992: 237-249
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Viswanathan Ramaiyer: Improved Approximations for the Steiner Tree Problem. SODA 1992: 325-334
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Juan A. Garay, Kenneth J. Perry: Optimal Early Stopping in Distributed Consensus (Extended Abstract). WDAG 1992: 221-237
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Georg Schnitger: On the Complexity of Approximating the Independent Set Problem Inf. Comput. 96(1): 77-94 (1992)
1991
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Juan A. Garay: Efficient Distributed Consensus with n = (3 + epsilon) t Processors (Extended Abstract). WDAG 1991: 129-142
1990
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Andrzej Pelc: Distributed probabilistic fault diagnosis for multiprocessor systems. FTCS 1990: 340-346
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Howard J. Karloff, Gábor Tardos: A Competitive 3-Server Algorithm. SODA 1990: 280-290
15no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMirjana Obradovic, Piotr Berman: Voting as the Optimal Static Pessimistic Scheme for Managing Replicated Data. SRDS 1990: 126-135
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMirjana Obradovic, Piotr Berman: Weighted Voting for Operation Dependent Management of Replicated Data. WDAG 1990: 263-276
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Juan A. Garay: Fast Consensus in Networks of Bounded Degree (Extended Abstract). WDAG 1990: 321-333
1989
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Juan A. Garay, Kenneth J. Perry: Towards Optimal Distributed Consensus (Extended Abstract) FOCS 1989: 410-415
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Juan A. Garay: Asymptotically Optimal Distributed Consensus (Extended Abstract). ICALP 1989: 80-94
10no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Juan A. Garay: Efficient Agreement on Bounded-Degree Networks. ICPP (1) 1989: 188-191
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Georg Schnitger: On the Complexity of Approximating the Independent Set Problem. STACS 1989: 256-268
1988
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Janos Simon: Investigations of Fault-Tolerant Networks of Computers (Preliminary Version) STOC 1988: 66-77
1987
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Robert Roos: Learning One-Counter Languages in Polynomial Time (Extended Abstract) FOCS 1987: 61-67
6no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Robert Roos: A Learning Algorithm for a Class of Context-Free Languages (Extended Abstract). ISMIS 1987: 317-324
1983
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman: Deterministic Dynamic Logic of Recursive Programs is Weaker than Dynamic Logic. FCT 1983: 14-25
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Janos Simon: Lower Bounds on Graph Threading by Probabilistic Machines (Preliminary Version) FOCS 1983: 304-311
1982
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Joseph Y. Halpern, Jerzy Tiuryn: On the Power of Nondeterminism in Dynamic Logic. ICALP 1982: 48-60
1980
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman: A Note on Sweeping Automata. ICALP 1980: 91-97
1978
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman: Relationship Between Density and Deterministic Complexity of NP-Complete Languages. ICALP 1978: 63-71

Coauthor Index

1Mary V. Ashley [135] [151]
2Irina Astrovskaya [133]
3Vineet Bafna [35] [54]
4Eldad Bar-Eli [22] [29]
5Amir Ben-Dor [71]
6Tanya Y. Berger-Wolf [135] [151]
7Paul Bertone [82] [97]
8Anupam A. Bharali [23] [26]
9Arnab Bhattacharyya [141] [153] [154]
10Avrim Blum [36]
11David S. Campo [133]
12Guohong Cao [116]
13Wanpracha Art Chaovalitwongse [135] [151]
14Moses Charikar [43] [64] [66]
15Qiong Cheng [134] [144]
16Chris Coulston [44] [50] [55]
17Surajit K. Das [105]
18Bhaskar DasGupta [41] [63] [68] [70] [77] [79] [82] [83] [85] [90] [97] [100] [101] [102] [103] [106] [115] [117] [118] [119] [120] [123] [127] [132] [135] [139] [149] [150] [151]
19Erik D. Demaine [155]
20Krzysztof Diks [40]
21Amos Fiat [22] [29] [36]
22Ulrich Fößmeier [33]
23Haoying Fu [107] [148]
24Toshihiro Fujito [34] [35] [53] [54]
25Junichiro Fukuyama [69] [78]
26Martin Fürer [32] [112]
27Juan A. Garay [10] [11] [12] [13] [18] [20] [24] [25] [27] [45] [52]
28Mark Gerstein (Mark B. Gerstein) [82] [97]
29Elena Grigorescu [141] [153]
30Deborah Gumucio [42]
31Aayush Gupta [152]
32Joseph Y. Halpern [3]
33Sridhar Hannenhalli [38] [73] [89]
34Ross C. Hardison [42] [140]
35Robert S. Harris [122]
36Robert W. Harrison [134] [144]
37Minmei Hou [110] [122] [140]
38Chih-Hao Hsu [122]
39Mary Jane Irwin [107] [148]
40Jieun K. Jeong [108] [125] [126] [128] [137]
41Andrew B. Kahng [57] [59] [65]
42Lakshmi Kaligounder [149]
43Mahmut T. Kandemir [156]
44Ming-Yang Kao [82] [97] [100] [103] [115] [135] [151]
45Howard J. Karloff [16] [36]
46Marek Karpinski [33] [43] [46] [48] [49] [60] [64] [66] [72] [73] [74] [75] [76] [80] [81] [84] [87] [88] [89] [91] [92] [93] [94] [98] [99] [104] [111] [113] [114] [117] [121] [129] [130] [131] [132] [136] [138] [139] [143] [146] [149]
47Shiva Prasad Kasiviswanathan [108] [124] [126]
48Michael Kaufmann [33]
49Yuri Khudyakov [133]
50Youngjae Kim [152]
51Orhan Kislal [156]
52Eugene V. Koonin [58] [62]
53Piotr Krysta [96]
54Lawrence L. Larmore [46] [80]
55Jie Liang [123]
56Andrzej Lingas [31] [39] [136] [146]
57Konstantin Makarychev [154]
58Webb Miller (Webb C. Miller) [42] [47] [51] [56] [58] [62] [86] [95] [110] [140]
59Dhruv Mubayi [101] [120]
60S. Muthukrishnan (S. Muthu Muthukrishnan) [70] [77] [79] [83] [85] [90]
61Yakov Nekrich [81] [87] [99] [113] [114]
62Mirjana Obradovic [14] [15]
63Itsik Pe'er [71]
64Andrzej Pelc [17] [40]
65Kenneth J. Perry [12] [20]
66Wojciech Plandowski [46] [80]
67Thomas F. La Porta (Tom La Porta) [107] [116] [148]
68Teresa M. Przytycka [125] [128]
69Viswanathan Ramaiyer [21] [28]
70Suneeta Ramaswami [70] [77]
71Sofya Raskhodnikova [141] [145] [147] [153] [154]
72Cathy Riemer [140]
73Robert Roos [6] [7]
74Adi Rosén [36]
75Ge Ruan [145]
76Wojciech Rytter [46] [80]
77Michael E. Saks (Michael Saks) [36]
78Georg Schnitger [9] [19]
79Alex D. Scott (Alexander D. Scott) [92] [93] [98] [121]
80Ron Shamir [71]
81Roded Sharan [71]
82Janos Simon [4] [8]
83Anand Sivasubramaniam [152]
84Robert H. Sloan [101] [120]
85Michael Snyder [82] [97]
86Eduardo D. Sontag [102] [119]
87Mirjana Spasojevic [30]
88Nikola Stojanovic [42] [109]
89Gábor Tardos [16]
90Jerzy Tiuryn [3]
91György Turán [101] [120]
92Bhuvan Urgaonkar [108] [126] [152]
93Vamsi Veeramachaneni [86] [95]
94Devendra Vidhani [57] [59] [65]
95Guiling Wang [107] [116] [148]
96Huijuan Wang [59] [65]
97Jie Wang [115]
98Kelly Westbrooks [133]
99Thomas Wiehe [56]
100Yuri I. Wolf [58] [62]
101David P. Woodruff [141] [153]
102Peiyuan Yan [22] [29]
103Grigory Yaroslavtsev [141] [153] [154]
104Morteza Zadimoghaddam [155]
105Alexander Zelikovsky [33] [57] [59] [65] [112] [129] [130] [131] [133] [134] [138] [143] [144]
106Louxin Zhang [110]
107Wensheng Zhang [148]
108Yi Zhang [101] [120]
109Zheng Zhang [47] [51] [56] [58] [62]

Colors in the list of coauthors

Home | Conferences | Journals | Series | FAQ — Search: Faceted | Free | Complete | Author
Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — This material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page