The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Piotr Berman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mirjana Obradovic, Piotr Berman
    Voting as the Optimal Static Pessimistic Scheme for Managing Replicated Data. [Citation Graph (1, 0)][DBLP]
    SRDS, 1990, pp:126-135 [Conf]
  2. Piotr Berman, Bhaskar DasGupta, Eduardo D. Sontag
    Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Networks. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:39-50 [Conf]
  3. Piotr Berman, Junichiro Fukuyama
    Variable length sequencing with two lengths. [Citation Graph (0, 0)][DBLP]
    APPROX, 2000, pp:51-59 [Conf]
  4. 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. [Citation Graph (0, 0)][DBLP]
    CPM, 2004, pp:244-253 [Conf]
  5. Piotr Berman, Sridhar Hannenhalli
    Fast Sorting by Reversal. [Citation Graph (0, 0)][DBLP]
    CPM, 1996, pp:168-185 [Conf]
  6. Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter
    On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts. [Citation Graph (0, 0)][DBLP]
    CPM, 1997, pp:40-51 [Conf]
  7. Piotr Berman, Martin Fürer, Alexander Zelikovsky
    Applications of the Linear Matroid Parity Algorithm to Approximating Steiner Trees. [Citation Graph (0, 0)][DBLP]
    CSR, 2006, pp:70-79 [Conf]
  8. Piotr Berman
    On-line Searching and Navigation. [Citation Graph (0, 0)][DBLP]
    Online Algorithms, 1996, pp:232-241 [Conf]
  9. Piotr Berman, Ulrich Fößmeier, Marek Karpinski, Michael Kaufmann, Alexander Zelikovsky
    Approaching the 5/4-Approximation for Rectilinear Steiner Trees. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:60-71 [Conf]
  10. Piotr Berman, Juan A. Garay
    Adaptability and the Usefulness of Hints (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1998, pp:271-282 [Conf]
  11. Piotr Berman, Sridhar Hannenhalli, Marek Karpinski
    1.375-Approximation Algorithm for Sorting by Reversals. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:200-210 [Conf]
  12. Piotr Berman
    Deterministic Dynamic Logic of Recursive Programs is Weaker than Dynamic Logic. [Citation Graph (0, 0)][DBLP]
    FCT, 1983, pp:14-25 [Conf]
  13. Piotr Berman, Juan A. Garay, Kenneth J. Perry
    Towards Optimal Distributed Consensus (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:410-415 [Conf]
  14. Piotr Berman, Robert Roos
    Learning One-Counter Languages in Polynomial Time (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:61-67 [Conf]
  15. Piotr Berman, Janos Simon
    Lower Bounds on Graph Threading by Probabilistic Machines (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1983, pp:304-311 [Conf]
  16. Piotr Berman, Juan A. Garay
    Randomized Distributed Agreement Revisited. [Citation Graph (0, 0)][DBLP]
    FTCS, 1993, pp:412-419 [Conf]
  17. Piotr Berman
    Relationship Between Density and Deterministic Complexity of NP-Complete Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1978, pp:63-71 [Conf]
  18. Piotr Berman
    A Note on Sweeping Automata. [Citation Graph (0, 0)][DBLP]
    ICALP, 1980, pp:91-97 [Conf]
  19. Piotr Berman, Juan A. Garay
    Asymptotically Optimal Distributed Consensus (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:80-94 [Conf]
  20. Piotr Berman, Joseph Y. Halpern, Jerzy Tiuryn
    On the Power of Nondeterminism in Dynamic Logic. [Citation Graph (0, 0)][DBLP]
    ICALP, 1982, pp:48-60 [Conf]
  21. Piotr Berman, Marek Karpinski
    Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:623-632 [Conf]
  22. Piotr Berman, Marek Karpinski
    On Some Tighter Inapproximability Results (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:200-209 [Conf]
  23. Piotr Berman, Marek Karpinski, Yakov Nekrich
    Approximating Huffman Codes in Parallel. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:845-855 [Conf]
  24. Piotr Berman, Juan A. Garay
    Efficient Agreement on Bounded-Degree Networks. [Citation Graph (0, 0)][DBLP]
    ICPP (1), 1989, pp:188-191 [Conf]
  25. Piotr Berman, Anupam A. Bharali
    Distributed Consensus in Semi-Synchronous Systems. [Citation Graph (0, 0)][DBLP]
    IPPS, 1992, pp:632-635 [Conf]
  26. Vamsi Veeramachaneni, Piotr Berman, Webb Miller
    Aligning Two Fragmented Sequences. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2002, pp:- [Conf]
  27. Vineet Bafna, Piotr Berman, Toshihiro Fujito
    Constant Ratio Approximations of the Weighted Feedback Vertex Set Problem for Undirected Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:142-151 [Conf]
  28. Guiling Wang, Mary Jane Irwin, Piotr Berman, Haoying Fu, Thomas F. La Porta
    Optimizing sensor movement planning for energy efficiency. [Citation Graph (0, 0)][DBLP]
    ISLPED, 2005, pp:215-220 [Conf]
  29. Piotr Berman, Robert Roos
    A Learning Algorithm for a Class of Context-Free Languages (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ISMIS, 1987, pp:317-324 [Conf]
  30. Piotr Berman, Andrew B. Kahng, Devendra Vidhani, Huijuan Wang, Alexander Zelikovsky
    Optimal phase conflict removal for layout of dark field alternating phase shifting masks. [Citation Graph (0, 0)][DBLP]
    ISPD, 1999, pp:121-126 [Conf]
  31. Piotr Berman, Juan A. Garay
    Competing against Specialists. [Citation Graph (0, 0)][DBLP]
    PODC, 1997, pp:284- [Conf]
  32. Piotr Berman, Junichiro Fukuyama
    An Online Algorithm for the Postman Problem with a Small Penalty. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:48-54 [Conf]
  33. Piotr Berman, Zheng Zhang 0004, Yuri I. Wolf, Eugene V. Koonin, Webb Miller
    Winnowing sequences from a database search. [Citation Graph (0, 0)][DBLP]
    RECOMB, 1999, pp:50-58 [Conf]
  34. Zheng Zhang 0004, Piotr Berman, Webb Miller
    Alignments without low-scoring regions. [Citation Graph (0, 0)][DBLP]
    RECOMB, 1998, pp:294-301 [Conf]
  35. Eldad Bar-Eli, Piotr Berman, Amos Fiat, Peiyuan Yan
    On-Line Navigation in a Room. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:237-249 [Conf]
  36. Piotr Berman, Avrim Blum, Amos Fiat, Howard J. Karloff, Adi Rosén, Michael E. Saks
    Randomized Robot Navigation Algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:75-84 [Conf]
  37. Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan
    Slice and dice: a simple, improved approximate tiling recipe. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:455-464 [Conf]
  38. Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan
    Simple approximation algorithm for nonoverlapping local alignments. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:677-678 [Conf]
  39. Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan, Suneeta Ramaswami
    Improved approximation algorithms for rectangle tiling and packing. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:427-436 [Conf]
  40. Piotr Berman, Martin Fürer
    Approximating Maximum Independent Set in Bounded Degree Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:365-371 [Conf]
  41. Piotr Berman, Marek Karpinski
    Approximating minimum unsatisfiability of linear equations. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:514-516 [Conf]
  42. Piotr Berman, Piotr Krysta
    Optimizing misdirection. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:192-201 [Conf]
  43. Piotr Berman, Marek Karpinski
    8/7-approximation algorithm for (1, 2)-TSP. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:641-648 [Conf]
  44. Piotr Berman, Howard J. Karloff, Gábor Tardos
    A Competitive 3-Server Algorithm. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:280-290 [Conf]
  45. Piotr Berman, Viswanathan Ramaiyer
    Improved Approximations for the Steiner Tree Problem. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:325-334 [Conf]
  46. Piotr Berman, Georg Schnitger
    On the Complexity of Approximating the Independent Set Problem. [Citation Graph (0, 0)][DBLP]
    STACS, 1989, pp:256-268 [Conf]
  47. Piotr Berman, Chris Coulston
    On-Line Algorithms for Steiner Tree Problems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:344-353 [Conf]
  48. Piotr Berman, Bhaskar DasGupta
    Improvements in throughout maximization for real-time scheduling. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:680-687 [Conf]
  49. Piotr Berman, Janos Simon
    Investigations of Fault-Tolerant Networks of Computers (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:66-77 [Conf]
  50. Piotr Berman
    A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:214-219 [Conf]
  51. Piotr Berman, Chris Coulston
    Speed is More Powerful than Claivoyance. [Citation Graph (0, 0)][DBLP]
    SWAT, 1998, pp:255-263 [Conf]
  52. Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
    Tight Approximability Results for Test Set Problems in Bioinformatics. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:39-50 [Conf]
  53. Piotr Berman, Andrzej Lingas
    A Nearly Optimal Parallel Algorithm for the Voronoi Diagram of a Convex Polygon. [Citation Graph (0, 0)][DBLP]
    SWAT, 1994, pp:73-82 [Conf]
  54. 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. [Citation Graph (0, 0)][DBLP]
    WABI, 2002, pp:419-433 [Conf]
  55. Minmei Hou, Piotr Berman, Louxin Zhang, Webb Miller
    Controlling Size When Aligning Multiple Genomic Sequences with Duplications. [Citation Graph (0, 0)][DBLP]
    WABI, 2006, pp:138-149 [Conf]
  56. Nikola Stojanovic, Piotr Berman
    A Linear-Time Algorithm for Studying Genetic Variation. [Citation Graph (0, 0)][DBLP]
    WABI, 2006, pp:344-354 [Conf]
  57. Piotr Berman, Moses Charikar, Marek Karpinski
    On-line Load Balancing for Related Machines. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:116-125 [Conf]
  58. Piotr Berman, Bhaskar DasGupta
    Approximating the Online Set Multicover Problems via Randomized Winnowing. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:110-121 [Conf]
  59. Piotr Berman, Surajit K. Das
    On the Vehicle Routing Problem. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:360-371 [Conf]
  60. Piotr Berman, Toshihiro Fujito
    On the Approximation Properties of Independent Set Problem in Degree 3 Graphs. [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:449-460 [Conf]
  61. 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. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:25-36 [Conf]
  62. Nikola Stojanovic, Piotr Berman, Deborah Gumucio, Ross C. Hardison, Webb Miller
    A Linear-Time Algorithm for the 1-Mismatch Problem. [Citation Graph (0, 0)][DBLP]
    WADS, 1997, pp:126-135 [Conf]
  63. Piotr Berman, Anupam A. Bharali
    Quick Atomic Broadcast (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WDAG, 1993, pp:189-203 [Conf]
  64. Piotr Berman, Juan A. Garay
    Fast Consensus in Networks of Bounded Degree (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WDAG, 1990, pp:321-333 [Conf]
  65. Piotr Berman, Juan A. Garay
    Efficient Distributed Consensus with n = (3 + epsilon) t Processors (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WDAG, 1991, pp:129-142 [Conf]
  66. Piotr Berman, Juan A. Garay, Kenneth J. Perry
    Optimal Early Stopping in Distributed Consensus (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WDAG, 1992, pp:221-237 [Conf]
  67. Mirjana Obradovic, Piotr Berman
    Weighted Voting for Operation Dependent Management of Replicated Data. [Citation Graph (0, 0)][DBLP]
    WDAG, 1990, pp:263-276 [Conf]
  68. Piotr Berman, Bhaskar DasGupta
    Complexities of Efficient Solutions of Rectilinear Polygon Cover Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:17, n:4, pp:331-356 [Journal]
  69. Zheng Zhang 0004, Piotr Berman, Thomas Wiehe, Webb Miller
    Post-processing long pairwise alignments. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 1999, v:15, n:12, pp:1012-1019 [Journal]
  70. Vamsi Veeramachaneni, Piotr Berman, Webb Miller
    Aligning two fragmented sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:127, n:1, pp:119-143 [Journal]
  71. Piotr Berman, Marek Karpinski, Alexander D. Scott
    Computational complexity of some restricted instances of 3-SAT. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:5, pp:649-653 [Journal]
  72. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:6-7, pp:719-732 [Journal]
  73. Piotr Berman, Bhaskar DasGupta, Eduardo D. Sontag
    Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:6-7, pp:733-749 [Journal]
  74. Piotr Berman, Juan A. Garay
    Fast Consensus in Networks of Bounded Degree. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 1993, v:7, n:2, pp:67-73 [Journal]
  75. Piotr Berman, Moses Charikar, Marek Karpinski
    On-Line Load Balancing for Related Machines [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:1, pp:- [Journal]
  76. Piotr Berman, Marek Karpinski
    Approximating Minimum Unsatisfiability of Linear Equations [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:25, pp:- [Journal]
  77. Piotr Berman, Marek Karpinski
    Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:26, pp:- [Journal]
  78. Piotr Berman, Sridhar Hannenhalli, Marek Karpinski
    1.375-Approximation Algorithm for Sorting by Reversals [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:47, pp:- [Journal]
  79. Piotr Berman, Marek Karpinski
    Efficient Amplifiers and Bounded Degree Optimization [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:53, pp:- [Journal]
  80. Piotr Berman, Amir Ben-Dor, Itsik Pe'er, Roded Sharan, Ron Shamir
    On the Complexity of Positional Sequencing by Hybridization [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:54, pp:- [Journal]
  81. Piotr Berman, Marek Karpinski
    Improved Approximations for General Minimum Cost Scheduling [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:, n:097, pp:- [Journal]
  82. Piotr Berman, Marek Karpinski, Yakov Nekrich
    Approximating Huffman Codes in Parallel [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:018, pp:- [Journal]
  83. Piotr Berman, Marek Karpinski
    Improved Approximation Lower Bounds on Small Occurrence Optimization [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:008, pp:- [Journal]
  84. Piotr Berman, Marek Karpinski, Alex D. Scott
    Approximation Hardness and Satisfiability of Bounded Occurrence Instances of SAT [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:022, pp:- [Journal]
  85. Piotr Berman, Marek Karpinski, Alex D. Scott
    Approximation Hardness of Short Symmetric Instances of MAX-3SAT [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:049, pp:- [Journal]
  86. Piotr Berman, Marek Karpinski
    Approximability of Hypergraph Minimum Bisection [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:056, pp:- [Journal]
  87. Piotr Berman, Marek Karpinski, Yakov Nekrich
    Optimal Trade-Off for Merkle Tree Traversal [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:049, pp:- [Journal]
  88. Piotr Berman, Marek Karpinski, Alexander D. Scott
    Computational Complexity of Some Restricted Instances of 3SAT [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:111, pp:- [Journal]
  89. Piotr Berman, Marek Karpinski
    8/7-Approximation Algorithm for (1,2)-TSP [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:069, pp:- [Journal]
  90. Piotr Berman, Georg Schnitger
    On the Complexity of Approximating the Independent Set Problem [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1992, v:96, n:1, pp:77-94 [Journal]
  91. Eldad Bar-Eli, Piotr Berman, Amos Fiat, Peiyuan Yan
    Online Navigation in a Room. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1994, v:17, n:3, pp:319-341 [Journal]
  92. Piotr Berman, Moses Charikar, Marek Karpinski
    On-Line Load Balancing for Related Machines. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:35, n:1, pp:108-121 [Journal]
  93. Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan
    Approximation algorithms for MAX-MIN tiling. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:47, n:2, pp:122-134 [Journal]
  94. Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan, Suneeta Ramaswami
    Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:41, n:2, pp:443-470 [Journal]
  95. Piotr Berman, Krzysztof Diks, Andrzej Pelc
    Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:22, n:2, pp:199-211 [Journal]
  96. Piotr Berman, Viswanathan Ramaiyer
    Improved Approximations for the Steiner Tree Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1994, v:17, n:3, pp:381-408 [Journal]
  97. 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. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2004, v:11, n:4, pp:766-785 [Journal]
  98. Piotr Berman, Zheng Zhang 0004, Yuri I. Wolf, Eugene V. Koonin, Webb Miller
    Winnowing Sequences from a Database Search. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2000, v:7, n:1-2, pp:293-302 [Journal]
  99. Zheng Zhang 0004, Piotr Berman, Webb Miller
    Alignments without Low-Scoring Regions. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1998, v:5, n:2, pp:197-210 [Journal]
  100. Piotr Berman, Bhaskar DasGupta
    Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2000, v:4, n:3, pp:307-323 [Journal]
  101. Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
    Tight approximability results for test set problems in bioinformatics. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:71, n:2, pp:145-162 [Journal]
  102. Piotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter
    On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:65, n:2, pp:332-350 [Journal]
  103. Piotr Berman, Toshihiro Fujito
    On Approximation Properties of the Independent Set Problem for Low Degree Graphs. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1999, v:32, n:2, pp:115-132 [Journal]
  104. Piotr Berman, Juan A. Garay
    Cloture Votes: n/4-Resilient Distributed Consensus in t+1 Rounds. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1993, v:26, n:1, pp:3-19 [Journal]
  105. Piotr Berman
    A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2000, v:7, n:3, pp:178-184 [Journal]
  106. Piotr Berman, Chris Coulston
    Speed is More Powerful than Clairvoyance. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1999, v:6, n:2, pp:181-193 [Journal]
  107. Piotr Berman, Bhaskar DasGupta, S. Muthukrishnan
    Exact Size of Binary Space Partitionings and Improved Rectangle Tiling Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2002, v:15, n:2, pp:252-267 [Journal]
  108. Vineet Bafna, Piotr Berman, Toshihiro Fujito
    A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:3, pp:289-297 [Journal]
  109. Piotr Berman, Andrew B. Kahng, Devendra Vidhani, Huijuan Wang, Alexander Zelikovsky
    Optimal phase conflict removal for layout of dark field alternatingphase shifting masks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 2000, v:19, n:2, pp:175-187 [Journal]
  110. Piotr Berman, Andrzej Lingas
    A Nearly Optimal Parallel Algorithm for the Voronoi Diagram of a Convex Polygon. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:174, n:1-2, pp:193-202 [Journal]
  111. Piotr Berman, Marek Karpinski, Yakov Nekrich
    Optimal trade-off for Merkle tree traversal. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:372, n:1, pp:26-36 [Journal]
  112. Mirjana Spasojevic, Piotr Berman
    Voting as the Optimal Static Pessimistic Scheme for Managing Replicated Data. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1994, v:5, n:1, pp:64-73 [Journal]
  113. Piotr Berman, Jieun K. Jeong, Shiva Prasad Kasiviswanathan, Bhuvan Urgaonkar
    Packing to angles and sectors. [Citation Graph (0, 0)][DBLP]
    SPAA, 2007, pp:171-180 [Conf]
  114. Jieun K. Jeong, Piotr Berman, Teresa M. Przytycka
    Bringing Folding Pathways into Strand Pairing Prediction. [Citation Graph (0, 0)][DBLP]
    WABI, 2007, pp:38-48 [Conf]
  115. Piotr Berman, Shiva Prasad Kasiviswanathan
    Faster Approximation of Distances in Graphs. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:541-552 [Conf]
  116. Piotr Berman, Bhaskar DasGupta, Jie Liang
    Foreword. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:48, n:4, pp:301- [Journal]
  117. Minmei Hou, Piotr Berman, Chih-Hao Hsu, Robert S. Harris
    HomologMiner: looking for homologous genomic groups in whole genomes. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2007, v:23, n:8, pp:917-925 [Journal]
  118. Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao, Jie Wang
    On constructing an optimal consensus clustering from multiple clusterings. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:104, n:4, pp:137-145 [Journal]
  119. Guiling Wang, Guohong Cao, Piotr Berman, Thomas F. La Porta
    Bidding Protocols for Deploying Mobile Sensors. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Mob. Comput., 2007, v:6, n:5, pp:563-576 [Journal]

  120. Approximation Algorithms for Min-Max Generalization Problems. [Citation Graph (, )][DBLP]


  121. Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems. [Citation Graph (, )][DBLP]


  122. Aligning Two Genomic Sequences That Contain Duplications. [Citation Graph (, )][DBLP]


  123. Approximating Transitive Reductions for Directed Networks. [Citation Graph (, )][DBLP]


  124. 1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2. [Citation Graph (, )][DBLP]


  125. HCV Quasispecies Assembly Using Network Flows. [Citation Graph (, )][DBLP]


  126. Successes and Failures of Elegant Algorithms in Computational Biology. [Citation Graph (, )][DBLP]


  127. Fast Alignments of Metabolic Networks. [Citation Graph (, )][DBLP]


  128. Consistent Sets of Secondary Structures in Proteins. [Citation Graph (, )][DBLP]


  129. Approximating Transitivity in Directed Networks [Citation Graph (, )][DBLP]


  130. 1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two [Citation Graph (, )][DBLP]


  131. A Factor 3/2 Approximation for Generalized Steiner Tree Problem with Distances One and Two [Citation Graph (, )][DBLP]


  132. Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems with Applications [Citation Graph (, )][DBLP]


  133. 1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two. [Citation Graph (, )][DBLP]


  134. Approximating Transitive Reductions for Directed Networks. [Citation Graph (, )][DBLP]


  135. Approximating the Online Set Multicover Problems Via Randomized Winnowing. [Citation Graph (, )][DBLP]


  136. Packing to angles and sectors. [Citation Graph (, )][DBLP]


Search in 0.095secs, Finished in 0.099secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002