Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Piotr Berman
@inproceedings{DBLP:conf/approx/BermanMRR23,
author = {Piotr Berman and
Meiram Murzabulatov and
Sofya Raskhodnikova and
Dragos Ristache},
editor = {Nicole Megow and
Adam D. Smith},
title = {Testing Connectedness of Images},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2023, September 11-13, 2023, Atlanta,
Georgia, {USA}},
series = {LIPIcs},
volume = {275},
pages = {66:1--66:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.66},
doi = {10.4230/LIPICS.APPROX/RANDOM.2023.66},
timestamp = {Sat, 09 Sep 2023 00:04:38 +0200},
biburl = {https://dblp.org/rec/conf/approx/BermanMRR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-03681,
author = {Piotr Berman and
Meiram Murzabulatov and
Sofya Raskhodnikova and
Dragos{-}Florian Ristache},
title = {Testing Connectedness of Images},
journal = {CoRR},
volume = {abs/2312.03681},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.03681},
doi = {10.48550/ARXIV.2312.03681},
eprinttype = {arXiv},
eprint = {2312.03681},
timestamp = {Mon, 01 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-03681.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BermanMR22,
author = {Piotr Berman and
Meiram Murzabulatov and
Sofya Raskhodnikova},
title = {Tolerant Testers of Image Properties},
journal = {{ACM} Trans. Algorithms},
volume = {18},
number = {4},
pages = {37:1--37:39},
year = {2022},
url = {https://doi.org/10.1145/3531527},
doi = {10.1145/3531527},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/BermanMR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BermanMR19,
author = {Piotr Berman and
Meiram Murzabulatov and
Sofya Raskhodnikova},
title = {The Power and Limitations of Uniform Samples in Testing Properties
of Figures},
journal = {Algorithmica},
volume = {81},
number = {3},
pages = {1247--1266},
year = {2019},
url = {https://doi.org/10.1007/s00453-018-0467-9},
doi = {10.1007/S00453-018-0467-9},
timestamp = {Fri, 12 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BermanMR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BermanMR19,
author = {Piotr Berman and
Meiram Murzabulatov and
Sofya Raskhodnikova},
title = {Testing convexity of figures under the uniform distribution},
journal = {Random Struct. Algorithms},
volume = {54},
number = {3},
pages = {413--443},
year = {2019},
url = {https://doi.org/10.1002/rsa.20797},
doi = {10.1002/RSA.20797},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BermanMR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/BermanMR16,
author = {Piotr Berman and
Meiram Murzabulatov and
Sofya Raskhodnikova},
editor = {S{\'{a}}ndor P. Fekete and
Anna Lubiw},
title = {Testing Convexity of Figures Under the Uniform Distribution},
booktitle = {32nd International Symposium on Computational Geometry, SoCG 2016,
June 14-18, 2016, Boston, MA, {USA}},
series = {LIPIcs},
volume = {51},
pages = {17:1--17:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2016.17},
doi = {10.4230/LIPICS.SOCG.2016.17},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/BermanMR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BermanMR16,
author = {Piotr Berman and
Meiram Murzabulatov and
Sofya Raskhodnikova},
editor = {Akash Lal and
S. Akshay and
Saket Saurabh and
Sandeep Sen},
title = {The Power and Limitations of Uniform Samples in Testing Properties
of Figures},
booktitle = {36th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2016, December 13-15, 2016,
Chennai, India},
series = {LIPIcs},
volume = {65},
pages = {45:1--45:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2016.45},
doi = {10.4230/LIPICS.FSTTCS.2016.45},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/BermanMR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BermanMR16,
author = {Piotr Berman and
Meiram Murzabulatov and
Sofya Raskhodnikova},
editor = {Ioannis Chatzigiannakis and
Michael Mitzenmacher and
Yuval Rabani and
Davide Sangiorgi},
title = {Tolerant Testers of Image Properties},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2016, July 11-15, 2016, Rome, Italy},
series = {LIPIcs},
volume = {55},
pages = {90:1--90:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.90},
doi = {10.4230/LIPICS.ICALP.2016.90},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BermanMR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BermanMR15,
author = {Piotr Berman and
Meiram Murzabulatov and
Sofya Raskhodnikova},
title = {Constant-Time Testing and Learning of Image Properties},
journal = {CoRR},
volume = {abs/1503.01363},
year = {2015},
url = {http://arxiv.org/abs/1503.01363},
eprinttype = {arXiv},
eprint = {1503.01363},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BermanMR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BermanF15,
author = {Piotr Berman and
Junichiro Fukuyama},
title = {The Distributed Selection Problem and the {AKS} Sorting Network},
journal = {CoRR},
volume = {abs/1511.00715},
year = {2015},
url = {http://arxiv.org/abs/1511.00715},
eprinttype = {arXiv},
eprint = {1511.00715},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BermanF15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BermanDKK14,
author = {Piotr Berman and
Bhaskar DasGupta and
Lakshmi Kaligounder and
Marek Karpinski},
title = {On the Computational Complexity of Measuring Global Stability of Banking
Networks},
journal = {Algorithmica},
volume = {70},
number = {4},
pages = {595--647},
year = {2014},
url = {https://doi.org/10.1007/s00453-013-9769-0},
doi = {10.1007/S00453-013-9769-0},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BermanDKK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/BermanBGRWY14,
author = {Piotr Berman and
Arnab Bhattacharyya and
Elena Grigorescu and
Sofya Raskhodnikova and
David P. Woodruff and
Grigory Yaroslavtsev},
title = {Steiner transitive-closure spanners of low-dimensional posets},
journal = {Comb.},
volume = {34},
number = {3},
pages = {255--277},
year = {2014},
url = {https://doi.org/10.1007/s00493-014-2833-9},
doi = {10.1007/S00493-014-2833-9},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/BermanBGRWY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BermanR14,
author = {Piotr Berman and
Sofya Raskhodnikova},
title = {Approximation Algorithms for Min-Max Generalization Problems},
journal = {{ACM} Trans. Algorithms},
volume = {11},
number = {1},
pages = {5:1--5:23},
year = {2014},
url = {https://doi.org/10.1145/2636920},
doi = {10.1145/2636920},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/BermanR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tjs/KimGUBS14,
author = {Youngjae Kim and
Aayush Gupta and
Bhuvan Urgaonkar and
Piotr Berman and
Anand Sivasubramaniam},
title = {HybridPlan: a capacity planning technique for projecting storage requirements
in hybrid storage systems},
journal = {J. Supercomput.},
volume = {67},
number = {1},
pages = {277--303},
year = {2014},
url = {https://doi.org/10.1007/s11227-013-0999-3},
doi = {10.1007/S11227-013-0999-3},
timestamp = {Fri, 22 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tjs/KimGUBS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BermanRY14,
author = {Piotr Berman and
Sofya Raskhodnikova and
Grigory Yaroslavtsev},
editor = {David B. Shmoys},
title = {L\({}_{\mbox{p}}\)-testing},
booktitle = {Symposium on Theory of Computing, {STOC} 2014, New York, NY, USA,
May 31 - June 03, 2014},
pages = {164--173},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2591796.2591887},
doi = {10.1145/2591796.2591887},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BermanRY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BermanBMRY13,
author = {Piotr Berman and
Arnab Bhattacharyya and
Konstantin Makarychev and
Sofya Raskhodnikova and
Grigory Yaroslavtsev},
title = {Approximation algorithms for spanner problems and Directed Steiner
Forest},
journal = {Inf. Comput.},
volume = {222},
pages = {93--107},
year = {2013},
url = {https://doi.org/10.1016/j.ic.2012.10.007},
doi = {10.1016/J.IC.2012.10.007},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BermanBMRY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BermanKL12,
author = {Piotr Berman and
Marek Karpinski and
Andrzej Lingas},
title = {Exact and Approximation Algorithms for Geometric and Capacitated Set
Cover Problems},
journal = {Algorithmica},
volume = {64},
number = {2},
pages = {295--310},
year = {2012},
url = {https://doi.org/10.1007/s00453-011-9591-5},
doi = {10.1007/S00453-011-9591-5},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BermanKL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BermanY12,
author = {Piotr Berman and
Grigory Yaroslavtsev},
editor = {Anupam Gupta and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Rocco A. Servedio},
title = {Primal-Dual Approximation Algorithms for Node-Weighted Network Design
in Planar Graphs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques - 15th International Workshop, {APPROX} 2012, and 16th
International Workshop, {RANDOM} 2012, Cambridge, MA, USA, August
15-17, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7408},
pages = {50--60},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32512-0\_5},
doi = {10.1007/978-3-642-32512-0\_5},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/BermanY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cf/KislalBK12,
author = {Orhan Kislal and
Piotr Berman and
Mahmut T. Kandemir},
editor = {John Feo and
Paolo Faraboschi and
Oreste Villa},
title = {Improving the performance of k-means clustering through computation
skipping and data locality optimizations},
booktitle = {Proceedings of the Computing Frontiers Conference, CF'12, Caligari,
Italy - May 15 - 17, 2012},
pages = {273--276},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2212908.2212951},
doi = {10.1145/2212908.2212951},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cf/KislalBK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tosn/WangIFBZP11,
author = {Guiling Wang and
Mary Jane Irwin and
Haoying Fu and
Piotr Berman and
Wensheng Zhang and
Tom La Porta},
title = {Optimizing sensor movement planning for energy efficiency},
journal = {{ACM} Trans. Sens. Networks},
volume = {7},
number = {4},
pages = {33:1--33:17},
year = {2011},
url = {https://doi.org/10.1145/1921621.1921627},
doi = {10.1145/1921621.1921627},
timestamp = {Tue, 16 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tosn/WangIFBZP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BermanDZ11,
author = {Piotr Berman and
Erik D. Demaine and
Morteza Zadimoghaddam},
editor = {Leslie Ann Goldberg and
Klaus Jansen and
R. Ravi and
Jos{\'{e}} D. P. Rolim},
title = {O(1)-Approximations for Maximum Movement Problems},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques - 14th International Workshop, {APPROX} 2011, and 15th
International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August
17-19, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6845},
pages = {62--74},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22935-0\_6},
doi = {10.1007/978-3-642-22935-0\_6},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/BermanDZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BermanBMRY11,
author = {Piotr Berman and
Arnab Bhattacharyya and
Konstantin Makarychev and
Sofya Raskhodnikova and
Grigory Yaroslavtsev},
editor = {Luca Aceto and
Monika Henzinger and
Jir{\'{\i}} Sgall},
title = {Improved Approximation for the Directed Spanner Problem},
booktitle = {Automata, Languages and Programming - 38th International Colloquium,
{ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6755},
pages = {1--12},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22006-7\_1},
doi = {10.1007/978-3-642-22006-7\_1},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BermanBMRY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BermanBGRWY11,
author = {Piotr Berman and
Arnab Bhattacharyya and
Elena Grigorescu and
Sofya Raskhodnikova and
David P. Woodruff and
Grigory Yaroslavtsev},
editor = {Luca Aceto and
Monika Henzinger and
Jir{\'{\i}} Sgall},
title = {Steiner Transitive-Closure Spanners of Low-Dimensional Posets},
booktitle = {Automata, Languages and Programming - 38th International Colloquium,
{ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6755},
pages = {760--772},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22006-7\_64},
doi = {10.1007/978-3-642-22006-7\_64},
timestamp = {Thu, 07 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/BermanBGRWY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mascots/KimGUBS11,
author = {Youngjae Kim and
Aayush Gupta and
Bhuvan Urgaonkar and
Piotr Berman and
Anand Sivasubramaniam},
title = {HybridStore: {A} Cost-Efficient, High-Performance Storage System Combining
SSDs and HDDs},
booktitle = {{MASCOTS} 2011, 19th Annual {IEEE/ACM} International Symposium on
Modeling, Analysis and Simulation of Computer and Telecommunication
Systems, Singapore, 25-27 July, 2011},
pages = {227--236},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/MASCOTS.2011.64},
doi = {10.1109/MASCOTS.2011.64},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mascots/KimGUBS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-1006,
author = {Mary V. Ashley and
Tanya Y. Berger{-}Wolf and
Piotr Berman and
Wanpracha Art Chaovalitwongse and
Bhaskar DasGupta and
Ming{-}Yang Kao},
title = {On Approximating Four Covering and Packing Problems},
journal = {CoRR},
volume = {abs/1102.1006},
year = {2011},
url = {http://arxiv.org/abs/1102.1006},
eprinttype = {arXiv},
eprint = {1102.1006},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1102-1006.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-4005,
author = {Piotr Berman and
Bhaskar DasGupta},
title = {Approximating the Online Set Multicover Problems Via Randomized Winnowing},
journal = {CoRR},
volume = {abs/1102.4005},
year = {2011},
url = {http://arxiv.org/abs/1102.4005},
eprinttype = {arXiv},
eprint = {1102.4005},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1102-4005.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1110-3546,
author = {Piotr Berman and
Bhaskar DasGupta and
Lakshmi Kaligounder and
Marek Karpinski},
title = {On Systemic Stability of Banking Networks},
journal = {CoRR},
volume = {abs/1110.3546},
year = {2011},
url = {http://arxiv.org/abs/1110.3546},
eprinttype = {arXiv},
eprint = {1110.3546},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1110-3546.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BermanR10,
author = {Piotr Berman and
Sofya Raskhodnikova},
editor = {Maria J. Serna and
Ronen Shaltiel and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim},
title = {Approximation Algorithms for Min-Max Generalization Problems},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 13th International Workshop, {APPROX} 2010, and 14th
International Workshop, {RANDOM} 2010, Barcelona, Spain, September
1-3, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6302},
pages = {53--66},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15369-3\_5},
doi = {10.1007/978-3-642-15369-3\_5},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/BermanR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/BermanKL10,
author = {Piotr Berman and
Marek Karpinski and
Andrzej Lingas},
editor = {My T. Thai and
Sartaj Sahni},
title = {Exact and Approximation Algorithms for Geometric and Capacitated Set
Cover Problems},
booktitle = {Computing and Combinatorics, 16th Annual International Conference,
{COCOON} 2010, Nha Trang, Vietnam, July 19-21, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6196},
pages = {226--234},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-14031-0\_26},
doi = {10.1007/978-3-642-14031-0\_26},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/BermanKL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BermanRR10,
author = {Piotr Berman and
Sofya Raskhodnikova and
Ge Ruan},
editor = {Kamal Lodaya and
Meena Mahajan},
title = {Finding Sparser Directed Spanners},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2010, December 15-18, 2010,
Chennai, India},
series = {LIPIcs},
volume = {8},
pages = {424--435},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2010},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2010.424},
doi = {10.4230/LIPICS.FSTTCS.2010.424},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/BermanRR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdm/ChengBHZ10,
author = {Qiong Cheng and
Piotr Berman and
Robert W. Harrison and
Alexander Zelikovsky},
editor = {Wei Fan and
Wynne Hsu and
Geoffrey I. Webb and
Bing Liu and
Chengqi Zhang and
Dimitrios Gunopulos and
Xindong Wu},
title = {Efficient Alignments of Metabolic Networks with Bounded Treewidth},
booktitle = {{ICDMW} 2010, The 10th {IEEE} International Conference on Data Mining
Workshops, Sydney, Australia, 13 December 2010},
pages = {687--694},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/ICDMW.2010.150},
doi = {10.1109/ICDMW.2010.150},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icdm/ChengBHZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BermanKZ10,
author = {Piotr Berman and
Marek Karpinski and
Alexander Zelikovsky},
editor = {Otfried Cheong and
Kyung{-}Yong Chwa and
Kunsoo Park},
title = {A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete
Graphs with Edge Lengths 1 and 2},
booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC}
2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6506},
pages = {15--24},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-17517-6\_4},
doi = {10.1007/978-3-642-17517-6\_4},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BermanKZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isbra/Berman10,
author = {Piotr Berman},
editor = {Mark Borodovsky and
Johann Peter Gogarten and
Teresa M. Przytycka and
Sanguthevar Rajasekaran},
title = {Successes and Failures of Elegant Algorithms in Computational Biology},
booktitle = {Bioinformatics Research and Applications, 6th International Symposium,
{ISBRA} 2010, Storrs, CT, USA, May 23-26, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6053},
pages = {2},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13078-6\_2},
doi = {10.1007/978-3-642-13078-6\_2},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/isbra/Berman10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1011-6100,
author = {Piotr Berman and
Arnab Bhattacharyya and
Elena Grigorescu and
Sofya Raskhodnikova and
David P. Woodruff and
Grigory Yaroslavtsev},
title = {Steiner Transitive-Closure Spanners of d-Dimensional Posets},
journal = {CoRR},
volume = {abs/1011.6100},
year = {2010},
url = {http://arxiv.org/abs/1011.6100},
eprinttype = {arXiv},
eprint = {1011.6100},
timestamp = {Thu, 07 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1011-6100.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BermanJ09,
author = {Piotr Berman and
Jieun K. Jeong},
title = {Consistent Sets of Secondary Structures in Proteins},
journal = {Algorithmica},
volume = {53},
number = {1},
pages = {16--34},
year = {2009},
url = {https://doi.org/10.1007/s00453-007-9068-8},
doi = {10.1007/S00453-007-9068-8},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BermanJ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/AshleyBBCDK09,
author = {Mary V. Ashley and
Tanya Y. Berger{-}Wolf and
Piotr Berman and
Wanpracha Art Chaovalitwongse and
Bhaskar DasGupta and
Ming{-}Yang Kao},
title = {On approximating four covering and packing problems},
journal = {J. Comput. Syst. Sci.},
volume = {75},
number = {5},
pages = {287--302},
year = {2009},
url = {https://doi.org/10.1016/j.jcss.2009.01.002},
doi = {10.1016/J.JCSS.2009.01.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/AshleyBBCDK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recomb/HouRBHM09,
author = {Minmei Hou and
Cathy Riemer and
Piotr Berman and
Ross C. Hardison and
Webb Miller},
editor = {Francesca D. Ciccarelli and
Istv{\'{a}}n Mikl{\'{o}}s},
title = {Aligning Two Genomic Sequences That Contain Duplications},
booktitle = {Comparative Genomics, International Workshop, {RECOMB-CG} 2009, Budapest,
Hungary, September 27-29, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5817},
pages = {98--110},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-04744-2\_9},
doi = {10.1007/978-3-642-04744-2\_9},
timestamp = {Mon, 13 May 2019 09:30:09 +0200},
biburl = {https://dblp.org/rec/conf/recomb/HouRBHM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BermanDK09,
author = {Piotr Berman and
Bhaskar DasGupta and
Marek Karpinski},
editor = {Frank K. H. A. Dehne and
Marina L. Gavrilova and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Csaba D. T{\'{o}}th},
title = {Approximating Transitive Reductions for Directed Networks},
booktitle = {Algorithms and Data Structures, 11th International Symposium, {WADS}
2009, Banff, Canada, August 21-23, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5664},
pages = {74--85},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03367-4\_7},
doi = {10.1007/978-3-642-03367-4\_7},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/BermanDK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BermanKZ09,
author = {Piotr Berman and
Marek Karpinski and
Alexander Zelikovsky},
editor = {Frank K. H. A. Dehne and
Marina L. Gavrilova and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Csaba D. T{\'{o}}th},
title = {1.25-Approximation Algorithm for Steiner Tree Problem with Distances
1 and 2},
booktitle = {Algorithms and Data Structures, 11th International Symposium, {WADS}
2009, Banff, Canada, August 21-23, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5664},
pages = {86--97},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03367-4\_8},
doi = {10.1007/978-3-642-03367-4\_8},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wads/BermanKZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0904-2310,
author = {Piotr Berman and
Marek Karpinski and
Andrzej Lingas},
title = {Exact and Approximation Algorithms for Geometric and Capacitated Set
Cover Problems with Applications},
journal = {CoRR},
volume = {abs/0904.2310},
year = {2009},
url = {http://arxiv.org/abs/0904.2310},
eprinttype = {arXiv},
eprint = {0904.2310},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0904-2310.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bmcsb/JeongB08,
author = {Jieun K. Jeong and
Piotr Berman},
title = {On cycles in the transcription network of Saccharomyces cerevisiae},
journal = {{BMC} Syst. Biol.},
volume = {2},
pages = {12},
year = {2008},
url = {https://doi.org/10.1186/1752-0509-2-12},
doi = {10.1186/1752-0509-2-12},
timestamp = {Tue, 05 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bmcsb/JeongB08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcbb/JeongBP08,
author = {Jieun K. Jeong and
Piotr Berman and
Teresa M. Przytycka},
title = {Improving Strand Pairing Prediction through Exploring Folding Cooperativity},
journal = {{IEEE} {ACM} Trans. Comput. Biol. Bioinform.},
volume = {5},
number = {4},
pages = {484--491},
year = {2008},
url = {https://doi.org/10.1109/TCBB.2008.88},
doi = {10.1109/TCBB.2008.88},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcbb/JeongBP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BermanD08,
author = {Piotr Berman and
Bhaskar DasGupta},
title = {Approximating the online set multicover problems via randomized winnowing},
journal = {Theor. Comput. Sci.},
volume = {393},
number = {1-3},
pages = {54--71},
year = {2008},
url = {https://doi.org/10.1016/j.tcs.2007.10.047},
doi = {10.1016/J.TCS.2007.10.047},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BermanD08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/bibm/ChengBHZ08,
author = {Qiong Cheng and
Piotr Berman and
Robert W. Harrison and
Alexander Zelikovsky},
editor = {Xue{-}wen Chen and
Xiaohua Hu and
Sun Kim},
title = {Fast Alignments of Metabolic Networks},
booktitle = {2008 {IEEE} International Conference on Bioinformatics and Biomedicine,
{BIBM} 2008, Philadephia, Pennsylvania, USA, November 3-5, 2008},
pages = {147--152},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/BIBM.2008.75},
doi = {10.1109/BIBM.2008.75},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/bibm/ChengBHZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isbra/WestbrooksACKBZ08,
author = {Kelly Westbrooks and
Irina Astrovskaya and
David S. Campo and
Yuri Khudyakov and
Piotr Berman and
Alexander Zelikovsky},
editor = {Ion I. Mandoiu and
Raj Sunderraman and
Alexander Zelikovsky},
title = {{HCV} Quasispecies Assembly Using Network Flows},
booktitle = {Bioinformatics Research and Applications, Fourth International Symposium,
{ISBRA} 2008, Atlanta, GA, USA, May 6-9, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4983},
pages = {159--170},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79450-9\_15},
doi = {10.1007/978-3-540-79450-9\_15},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/isbra/WestbrooksACKBZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0809-0188,
author = {Piotr Berman and
Bhaskar DasGupta and
Marek Karpinski},
title = {Approximating Transitivity in Directed Networks},
journal = {CoRR},
volume = {abs/0809.0188},
year = {2008},
url = {http://arxiv.org/abs/0809.0188},
eprinttype = {arXiv},
eprint = {0809.0188},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0809-0188.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0810-1851,
author = {Piotr Berman and
Marek Karpinski and
Alexander Zelikovsky},
title = {1.25 Approximation Algorithm for the Steiner Tree Problem with Distances
One and Two},
journal = {CoRR},
volume = {abs/0810.1851},
year = {2008},
url = {http://arxiv.org/abs/0810.1851},
eprinttype = {arXiv},
eprint = {0810.1851},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0810-1851.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0812-2137,
author = {Piotr Berman and
Marek Karpinski and
Alexander Zelikovsky},
title = {A Factor 3/2 Approximation for Generalized Steiner Tree Problem with
Distances One and Two},
journal = {CoRR},
volume = {abs/0812.2137},
year = {2008},
url = {http://arxiv.org/abs/0812.2137},
eprinttype = {arXiv},
eprint = {0812.2137},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0812-2137.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BermanKZ08,
author = {Piotr Berman and
Marek Karpinski and
Alexander Zelikovsky},
title = {1.25 Approximation Algorithm for the Steiner Tree Problem with Distances
One and Two},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR08-094}},
year = {2008},
url = {https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-094/index.html},
eprinttype = {ECCC},
eprint = {TR08-094},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BermanKZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BermanDL07,
author = {Piotr Berman and
Bhaskar DasGupta and
Jie Liang},
title = {Foreword},
journal = {Algorithmica},
volume = {48},
number = {4},
pages = {301},
year = {2007},
url = {https://doi.org/10.1007/s00453-007-0357-z},
doi = {10.1007/S00453-007-0357-Z},
timestamp = {Tue, 14 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BermanDL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bioinformatics/HouBHH07,
author = {Minmei Hou and
Piotr Berman and
Chih{-}Hao Hsu and
Robert S. Harris},
title = {HomologMiner: looking for homologous genomic groups in whole genomes},
journal = {Bioinform.},
volume = {23},
number = {8},
pages = {917--925},
year = {2007},
url = {https://doi.org/10.1093/bioinformatics/btm048},
doi = {10.1093/BIOINFORMATICS/BTM048},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bioinformatics/HouBHH07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BermanKS07,
author = {Piotr Berman and
Marek Karpinski and
Alexander D. Scott},
title = {Computational complexity of some restricted instances of 3-SAT},
journal = {Discret. Appl. Math.},
volume = {155},
number = {5},
pages = {649--653},
year = {2007},
url = {https://doi.org/10.1016/j.dam.2006.07.009},
doi = {10.1016/J.DAM.2006.07.009},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BermanKS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BermanDMSTZ07,
author = {Piotr Berman and
Bhaskar DasGupta and
Dhruv Mubayi and
Robert H. Sloan and
Gy{\"{o}}rgy Tur{\'{a}}n and
Yi Zhang},
title = {The inverse protein folding problem on 2D and 3D lattices},
journal = {Discret. Appl. Math.},
volume = {155},
number = {6-7},
pages = {719--732},
year = {2007},
url = {https://doi.org/10.1016/j.dam.2005.09.018},
doi = {10.1016/J.DAM.2005.09.018},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BermanDMSTZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BermanDS07,
author = {Piotr Berman and
Bhaskar DasGupta and
Eduardo D. Sontag},
title = {Randomized approximation algorithms for set multicover problems with
applications to reverse engineering of protein and gene networks},
journal = {Discret. Appl. Math.},
volume = {155},
number = {6-7},
pages = {733--749},
year = {2007},
url = {https://doi.org/10.1016/j.dam.2004.11.009},
doi = {10.1016/J.DAM.2004.11.009},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BermanDS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BermanDKW07,
author = {Piotr Berman and
Bhaskar DasGupta and
Ming{-}Yang Kao and
Jie Wang},
title = {On constructing an optimal consensus clustering from multiple clusterings},
journal = {Inf. Process. Lett.},
volume = {104},
number = {4},
pages = {137--145},
year = {2007},
url = {https://doi.org/10.1016/j.ipl.2007.06.008},
doi = {10.1016/J.IPL.2007.06.008},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BermanDKW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BermanKN07,
author = {Piotr Berman and
Marek Karpinski and
Yakov Nekrich},
title = {Approximating Huffman codes in parallel},
journal = {J. Discrete Algorithms},
volume = {5},
number = {3},
pages = {479--490},
year = {2007},
url = {https://doi.org/10.1016/j.jda.2006.10.007},
doi = {10.1016/J.JDA.2006.10.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BermanKN07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BermanKN07,
author = {Piotr Berman and
Marek Karpinski and
Yakov Nekrich},
title = {Optimal trade-off for Merkle tree traversal},
journal = {Theor. Comput. Sci.},
volume = {372},
number = {1},
pages = {26--36},
year = {2007},
url = {https://doi.org/10.1016/j.tcs.2006.11.029},
doi = {10.1016/J.TCS.2006.11.029},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BermanKN07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tmc/WangCBP07,
author = {Guiling Wang and
Guohong Cao and
Piotr Berman and
Thomas F. La Porta},
title = {Bidding Protocols for Deploying Mobile Sensors},
journal = {{IEEE} Trans. Mob. Comput.},
volume = {6},
number = {5},
pages = {563--576},
year = {2007},
url = {https://doi.org/10.1109/TMC.2007.1022},
doi = {10.1109/TMC.2007.1022},
timestamp = {Wed, 17 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tmc/WangCBP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/BermanJKU07,
author = {Piotr Berman and
Jieun K. Jeong and
Shiva Prasad Kasiviswanathan and
Bhuvan Urgaonkar},
editor = {Phillip B. Gibbons and
Christian Scheideler},
title = {Packing to angles and sectors},
booktitle = {{SPAA} 2007: Proceedings of the 19th Annual {ACM} Symposium on Parallelism
in Algorithms and Architectures, San Diego, California, USA, June
9-11, 2007},
pages = {171--180},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1248377.1248405},
doi = {10.1145/1248377.1248405},
timestamp = {Wed, 21 Nov 2018 11:13:44 +0100},
biburl = {https://dblp.org/rec/conf/spaa/BermanJKU07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/JeongBP07,
author = {Jieun K. Jeong and
Piotr Berman and
Teresa M. Przytycka},
editor = {Raffaele Giancarlo and
Sridhar Hannenhalli},
title = {Bringing Folding Pathways into Strand Pairing Prediction},
booktitle = {Algorithms in Bioinformatics, 7th International Workshop, {WABI} 2007,
Philadelphia, PA, USA, September 8-9, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4645},
pages = {38--48},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74126-8\_5},
doi = {10.1007/978-3-540-74126-8\_5},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wabi/JeongBP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BermanK07,
author = {Piotr Berman and
Shiva Prasad Kasiviswanathan},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Norbert Zeh},
title = {Faster Approximation of Distances in Graphs},
booktitle = {Algorithms and Data Structures, 10th International Workshop, {WADS}
2007, Halifax, Canada, August 15-17, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4619},
pages = {541--552},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73951-7\_47},
doi = {10.1007/978-3-540-73951-7\_47},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/BermanK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BermanD07,
author = {Piotr Berman and
Bhaskar DasGupta},
title = {Approximating the Online Set Multicover Problems Via Randomized Winnowing},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR07-092}},
year = {2007},
url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-092/index.html},
eprinttype = {ECCC},
eprint = {TR07-092},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BermanD07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BermanDK07,
author = {Piotr Berman and
Bhaskar DasGupta and
Marek Karpinski},
title = {Approximating Transitive Reductions for Directed Networks},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR07-119}},
year = {2007},
url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-119/index.html},
eprinttype = {ECCC},
eprint = {TR07-119},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BermanDK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/BermanFZ06,
author = {Piotr Berman and
Martin F{\"{u}}rer and
Alexander Zelikovsky},
editor = {Dima Grigoriev and
John Harrison and
Edward A. Hirsch},
title = {Applications of the Linear Matroid Parity Algorithm to Approximating
Steiner Trees},
booktitle = {Computer Science - Theory and Applications, First International Symposium
on Computer Science in Russia, {CSR} 2006, St. Petersburg, Russia,
June 8-12, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3967},
pages = {70--79},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11753728\_10},
doi = {10.1007/11753728\_10},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/csr/BermanFZ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BermanK06,
author = {Piotr Berman and
Marek Karpinski},
title = {8/7-approximation algorithm for (1, 2)-TSP},
booktitle = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
pages = {641--648},
publisher = {{ACM} Press},
year = {2006},
url = {http://dl.acm.org/citation.cfm?id=1109557.1109627},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/BermanK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/HouBZM06,
author = {Minmei Hou and
Piotr Berman and
Louxin Zhang and
Webb Miller},
editor = {Philipp Bucher and
Bernard M. E. Moret},
title = {Controlling Size When Aligning Multiple Genomic Sequences with Duplications},
booktitle = {Algorithms in Bioinformatics, 6th International Workshop, {WABI} 2006,
Zurich, Switzerland, September 11-13, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4175},
pages = {138--149},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11851561\_13},
doi = {10.1007/11851561\_13},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wabi/HouBZM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/StojanovicB06,
author = {Nikola Stojanovic and
Piotr Berman},
editor = {Philipp Bucher and
Bernard M. E. Moret},
title = {A Linear-Time Algorithm for Studying Genetic Variation},
booktitle = {Algorithms in Bioinformatics, 6th International Workshop, {WABI} 2006,
Zurich, Switzerland, September 11-13, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4175},
pages = {344--354},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11851561\_32},
doi = {10.1007/11851561\_32},
timestamp = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wabi/StojanovicB06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BermanJKU06,
author = {Piotr Berman and
Jieun K. Jeong and
Shiva Prasad Kasiviswanathan and
Bhuvan Urgaonkar},
title = {Packing to angles and sectors},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-030}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-030/index.html},
eprinttype = {ECCC},
eprint = {TR06-030},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BermanJKU06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BermanDK05,
author = {Piotr Berman and
Bhaskar DasGupta and
Ming{-}Yang Kao},
title = {Tight approximability results for test set problems in bioinformatics},
journal = {J. Comput. Syst. Sci.},
volume = {71},
number = {2},
pages = {145--162},
year = {2005},
url = {https://doi.org/10.1016/j.jcss.2005.02.001},
doi = {10.1016/J.JCSS.2005.02.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BermanDK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icete/BermanKN05,
author = {Piotr Berman and
Marek Karpinski and
Yakov Nekrich},
editor = {Joaquim Filipe and
Helder Coelhas and
M{\'{o}}nica Saramago},
title = {Optimal Trade-Off for Merkle Tree Traversal},
booktitle = {E-business and Telecommunication Networks - Second International Conference,
{ICETE} 2005, Reading, UK, October 3-7, 2005. Selected Papers},
series = {Communications in Computer and Information Science},
volume = {3},
pages = {150--162},
year = {2005},
url = {https://doi.org/10.1007/978-3-540-75993-5\_13},
doi = {10.1007/978-3-540-75993-5\_13},
timestamp = {Tue, 16 Aug 2022 23:04:29 +0200},
biburl = {https://dblp.org/rec/conf/icete/BermanKN05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/islped/WangIBFP05,
author = {Guiling Wang and
Mary Jane Irwin and
Piotr Berman and
Haoying Fu and
Thomas F. La Porta},
editor = {Kaushik Roy and
Vivek Tiwari},
title = {Optimizing sensor movement planning for energy efficiency},
booktitle = {Proceedings of the 2005 International Symposium on Low Power Electronics
and Design, 2005, San Diego, California, USA, August 8-10, 2005},
pages = {215--220},
publisher = {{ACM}},
year = {2005},
url = {https://doi.org/10.1145/1077603.1077656},
doi = {10.1145/1077603.1077656},
timestamp = {Wed, 17 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/islped/WangIBFP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BermanD05,
author = {Piotr Berman and
Bhaskar DasGupta},
editor = {Frank K. H. A. Dehne and
Alejandro L{\'{o}}pez{-}Ortiz and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Approximating the Online Set Multicover Problems via Randomized Winnowing},
booktitle = {Algorithms and Data Structures, 9th International Workshop, {WADS}
2005, Waterloo, Canada, August 15-17, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3608},
pages = {110--121},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11534273\_11},
doi = {10.1007/11534273\_11},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/BermanD05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BermanD05a,
author = {Piotr Berman and
Surajit K. Das},
editor = {Frank K. H. A. Dehne and
Alejandro L{\'{o}}pez{-}Ortiz and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {On the Vehicle Routing Problem},
booktitle = {Algorithms and Data Structures, 9th International Workshop, {WADS}
2005, Waterloo, Canada, August 15-17, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3608},
pages = {360--371},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11534273\_32},
doi = {10.1007/11534273\_32},
timestamp = {Sun, 21 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BermanD05a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-069,
author = {Piotr Berman and
Marek Karpinski},
title = {8/7-Approximation Algorithm for (1,2)-TSP},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-069}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-069/index.html},
eprinttype = {ECCC},
eprint = {TR05-069},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-069.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/BermanBDGKS04,
author = {Piotr Berman and
Paul Bertone and
Bhaskar DasGupta and
Mark Gerstein and
Ming{-}Yang Kao and
Michael Snyder},
title = {Fast Optimal Genome Tiling with Applications to Microarray Design
and Homology Search},
journal = {J. Comput. Biol.},
volume = {11},
number = {4},
pages = {766--785},
year = {2004},
url = {https://doi.org/10.1089/cmb.2004.11.766},
doi = {10.1089/CMB.2004.11.766},
timestamp = {Mon, 15 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcb/BermanBDGKS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BermanDS04,
author = {Piotr Berman and
Bhaskar DasGupta and
Eduardo D. Sontag},
editor = {Klaus Jansen and
Sanjeev Khanna and
Jos{\'{e}} D. P. Rolim and
Dana Ron},
title = {Randomized Approximation Algorithms for Set Multicover Problems with
Applications to Reverse Engineering of Protein and Gene Networks},
booktitle = {Approximation, Randomization, and Combinatorial Optimization, Algorithms
and Techniques, 7th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2004, and 8th International
Workshop on Randomization and Computation, {RANDOM} 2004, Cambridge,
MA, USA, August 22-24, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3122},
pages = {39--50},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27821-4\_4},
doi = {10.1007/978-3-540-27821-4\_4},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/BermanDS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BermanDMSTZ04,
author = {Piotr Berman and
Bhaskar DasGupta and
Dhruv Mubayi and
Robert H. Sloan and
Gy{\"{o}}rgy Tur{\'{a}}n and
Yi Zhang},
editor = {S{\"{u}}leyman Cenk Sahinalp and
S. Muthukrishnan and
Ugur Dogrus{\"{o}}z},
title = {The Protein Sequence Design Problem in Canonical Model on 2D and 3D
Lattices},
booktitle = {Combinatorial Pattern Matching, 15th Annual Symposium, {CPM} 2004,
Istanbul,Turkey, July 5-7, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3109},
pages = {244--253},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27801-6\_18},
doi = {10.1007/978-3-540-27801-6\_18},
timestamp = {Fri, 07 May 2021 12:57:04 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BermanDMSTZ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BermanDK04,
author = {Piotr Berman and
Bhaskar DasGupta and
Ming{-}Yang Kao},
editor = {Torben Hagerup and
Jyrki Katajainen},
title = {Tight Approximability Results for Test Set Problems in Bioinformatics},
booktitle = {Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm
Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3111},
pages = {39--50},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27810-8\_5},
doi = {10.1007/978-3-540-27810-8\_5},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/BermanDK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wcnc/BermanCSZ04,
author = {Piotr Berman and
Gruia C{\u{a}}linescu and
C. Shah and
Alexander Zelikovsky},
title = {Power efficient monitoring management in sensor networks},
booktitle = {2004 {IEEE} Wireless Communications and Networking Conference , {WCNC}
2004, Atlanta, Georgia, USA, 21-25 March 2004},
pages = {2329--2334},
publisher = {{IEEE}},
year = {2004},
url = {https://doi.org/10.1109/WCNC.2004.1311452},
doi = {10.1109/WCNC.2004.1311452},
timestamp = {Wed, 16 Oct 2019 14:14:50 +0200},
biburl = {https://dblp.org/rec/conf/wcnc/BermanCSZ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-049,
author = {Piotr Berman and
Marek Karpinski and
Yakov Nekrich},
title = {Optimal Trade-Off for Merkle Tree Traversal},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-049}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-049/index.html},
eprinttype = {ECCC},
eprint = {TR04-049},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-049.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-111,
author = {Piotr Berman and
Marek Karpinski and
Alexander D. Scott},
title = {Computational Complexity of Some Restricted Instances of 3SAT},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-111}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-111/index.html},
eprinttype = {ECCC},
eprint = {TR04-111},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-111.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/VeeramachaneniBM03,
author = {Vamsi Veeramachaneni and
Piotr Berman and
Webb Miller},
title = {Aligning two fragmented sequences},
journal = {Discret. Appl. Math.},
volume = {127},
number = {1},
pages = {119--143},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00289-5},
doi = {10.1016/S0166-218X(02)00289-5},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/VeeramachaneniBM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BermanDM03,
author = {Piotr Berman and
Bhaskar DasGupta and
S. Muthukrishnan},
title = {Approximation algorithms for {MAX-MIN} tiling},
journal = {J. Algorithms},
volume = {47},
number = {2},
pages = {122--134},
year = {2003},
url = {https://doi.org/10.1016/S0196-6774(03)00015-4},
doi = {10.1016/S0196-6774(03)00015-4},
timestamp = {Mon, 10 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BermanDM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BermanK03,
author = {Piotr Berman and
Piotr Krysta},
title = {Optimizing misdirection},
booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
pages = {192--201},
publisher = {{ACM/SIAM}},
year = {2003},
url = {http://dl.acm.org/citation.cfm?id=644108.644142},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/BermanK03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR03-008,
author = {Piotr Berman and
Marek Karpinski},
title = {Improved Approximation Lower Bounds on Small Occurrence Optimization},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR03-008}},
year = {2003},
url = {https://eccc.weizmann.ac.il/eccc-reports/2003/TR03-008/index.html},
eprinttype = {ECCC},
eprint = {TR03-008},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR03-008.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR03-022,
author = {Piotr Berman and
Marek Karpinski and
Alex D. Scott},
title = {Approximation Hardness and Satisfiability of Bounded Occurrence Instances
of {SAT}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR03-022}},
year = {2003},
url = {https://eccc.weizmann.ac.il/eccc-reports/2003/TR03-022/index.html},
eprinttype = {ECCC},
eprint = {TR03-022},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR03-022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR03-049,
author = {Piotr Berman and
Marek Karpinski and
Alex D. Scott},
title = {Approximation Hardness of Short Symmetric Instances of {MAX-3SAT}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR03-049}},
year = {2003},
url = {https://eccc.weizmann.ac.il/eccc-reports/2003/TR03-049/index.html},
eprinttype = {ECCC},
eprint = {TR03-049},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR03-049.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR03-056,
author = {Piotr Berman and
Marek Karpinski},
title = {Approximability of Hypergraph Minimum Bisection},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR03-056}},
year = {2003},
url = {https://eccc.weizmann.ac.il/eccc-reports/2003/TR03-056/index.html},
eprinttype = {ECCC},
eprint = {TR03-056},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR03-056.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BermanKLPR02,
author = {Piotr Berman and
Marek Karpinski and
Lawrence L. Larmore and
Wojciech Plandowski and
Wojciech Rytter},
title = {On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional
Texts},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {2},
pages = {332--350},
year = {2002},
url = {https://doi.org/10.1006/jcss.2002.1852},
doi = {10.1006/JCSS.2002.1852},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BermanKLPR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BermanDM02,
author = {Piotr Berman and
Bhaskar DasGupta and
S. Muthukrishnan},
title = {Exact Size of Binary Space Partitionings and Improved Rectangle Tiling
Algorithms},
journal = {{SIAM} J. Discret. Math.},
volume = {15},
number = {2},
pages = {252--267},
year = {2002},
url = {https://doi.org/10.1137/S0895480101384347},
doi = {10.1137/S0895480101384347},
timestamp = {Mon, 10 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BermanDM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BermanHK02,
author = {Piotr Berman and
Sridhar Hannenhalli and
Marek Karpinski},
editor = {Rolf H. M{\"{o}}hring and
Rajeev Raman},
title = {1.375-Approximation Algorithm for Sorting by Reversals},
booktitle = {Algorithms - {ESA} 2002, 10th Annual European Symposium, Rome, Italy,
September 17-21, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2461},
pages = {200--210},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45749-6\_21},
doi = {10.1007/3-540-45749-6\_21},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/BermanHK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BermanK02,
author = {Piotr Berman and
Marek Karpinski},
editor = {Peter Widmayer and
Francisco Triguero Ruiz and
Rafael Morales Bueno and
Matthew Hennessy and
Stephan J. Eidenbenz and
Ricardo Conejo},
title = {Approximation Hardness of Bounded Degree {MIN-CSP} and {MIN-BISECTION}},
booktitle = {Automata, Languages and Programming, 29th International Colloquium,
{ICALP} 2002, Malaga, Spain, July 8-13, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2380},
pages = {623--632},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45465-9\_53},
doi = {10.1007/3-540-45465-9\_53},
timestamp = {Wed, 11 Sep 2019 13:15:53 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BermanK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BermanKN02,
author = {Piotr Berman and
Marek Karpinski and
Yakov Nekrich},
editor = {Peter Widmayer and
Francisco Triguero Ruiz and
Rafael Morales Bueno and
Matthew Hennessy and
Stephan J. Eidenbenz and
Ricardo Conejo},
title = {Approximating Huffman Codes in Parallel},
booktitle = {Automata, Languages and Programming, 29th International Colloquium,
{ICALP} 2002, Malaga, Spain, July 8-13, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2380},
pages = {845--855},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45465-9\_72},
doi = {10.1007/3-540-45465-9\_72},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BermanKN02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/VeeramachaneniBM02,
author = {Vamsi Veeramachaneni and
Piotr Berman and
Webb Miller},
title = {Aligning Two Fragmented Sequences},
booktitle = {16th International Parallel and Distributed Processing Symposium {(IPDPS}
2002), 15-19 April 2002, Fort Lauderdale, FL, USA, CD-ROM/Abstracts
Proceedings},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/IPDPS.2002.1016591},
doi = {10.1109/IPDPS.2002.1016591},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipps/VeeramachaneniBM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BermanDM02,
author = {Piotr Berman and
Bhaskar DasGupta and
S. Muthukrishnan},
editor = {David Eppstein},
title = {Slice and dice: a simple, improved approximate tiling recipe},
booktitle = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
pages = {455--464},
publisher = {{ACM/SIAM}},
year = {2002},
url = {http://dl.acm.org/citation.cfm?id=545381.545442},
timestamp = {Mon, 10 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BermanDM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BermanK02,
author = {Piotr Berman and
Marek Karpinski},
editor = {David Eppstein},
title = {Approximating minimum unsatisfiability of linear equations},
booktitle = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
pages = {514--516},
publisher = {{ACM/SIAM}},
year = {2002},
url = {http://dl.acm.org/citation.cfm?id=545381.545450},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BermanK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BermanDM02a,
author = {Piotr Berman and
Bhaskar DasGupta and
S. Muthukrishnan},
editor = {David Eppstein},
title = {Simple approximation algorithm for nonoverlapping local alignments},
booktitle = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
pages = {677--678},
publisher = {{ACM/SIAM}},
year = {2002},
url = {http://dl.acm.org/citation.cfm?id=545381.545471},
timestamp = {Mon, 10 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BermanDM02a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wabi/BermanBDGKS02,
author = {Piotr Berman and
Paul Bertone and
Bhaskar DasGupta and
Mark Gerstein and
Ming{-}Yang Kao and
Michael Snyder},
editor = {Roderic Guig{\'{o}} and
Dan Gusfield},
title = {Fast Optimal Genome Tiling with Applications to Microarray Design
and Homology Search},
booktitle = {Algorithms in Bioinformatics, Second International Workshop, {WABI}
2002, Rome, Italy, September 17-21, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2452},
pages = {419--433},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45784-4\_32},
doi = {10.1007/3-540-45784-4\_32},
timestamp = {Mon, 15 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wabi/BermanBDGKS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-018,
author = {Piotr Berman and
Marek Karpinski and
Yakov Nekrich},
title = {Approximating Huffman Codes in Parallel},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-018}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-018/index.html},
eprinttype = {ECCC},
eprint = {TR02-018},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BermanDMR01,
author = {Piotr Berman and
Bhaskar DasGupta and
S. Muthukrishnan and
Suneeta Ramaswami},
title = {Efficient Approximation Algorithms for Tiling and Packing Problems
with Rectangles},
journal = {J. Algorithms},
volume = {41},
number = {2},
pages = {443--470},
year = {2001},
url = {https://doi.org/10.1006/jagm.2001.1188},
doi = {10.1006/JAGM.2001.1188},
timestamp = {Mon, 10 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BermanDMR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/random/BermanF01,
author = {Piotr Berman and
Junichiro Fukuyama},
editor = {Michel X. Goemans and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Luca Trevisan},
title = {An Online Algorithm for the Postman Problem with a Small Penalty},
booktitle = {Approximation, Randomization and Combinatorial Optimization: Algorithms
and Techniques, 4th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2001 and 5th International
Workshop on Randomization and Approximation Techniques in Computer
Science, {RANDOM} 2001 Berkeley, CA, USA, August 18-20, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2129},
pages = {48--54},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44666-4\_9},
doi = {10.1007/3-540-44666-4\_9},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/random/BermanF01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BermanDMR01,
author = {Piotr Berman and
Bhaskar DasGupta and
S. Muthukrishnan and
Suneeta Ramaswami},
editor = {S. Rao Kosaraju},
title = {Improved approximation algorithms for rectangle tiling and packing},
booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms,
January 7-9, 2001, Washington, DC, {USA}},
pages = {427--436},
publisher = {{ACM/SIAM}},
year = {2001},
url = {http://dl.acm.org/citation.cfm?id=365411.365496},
timestamp = {Mon, 10 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/BermanDMR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR01-025,
author = {Piotr Berman and
Marek Karpinski},
title = {Approximating Minimum Unsatisfiability of Linear Equations},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR01-025}},
year = {2001},
url = {https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-025/index.html},
eprinttype = {ECCC},
eprint = {TR01-025},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR01-025.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR01-026,
author = {Piotr Berman and
Marek Karpinski},
title = {Approximation Hardness of Bounded Degree {MIN-CSP} and {MIN-BISECTION}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR01-026}},
year = {2001},
url = {https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-026/index.html},
eprinttype = {ECCC},
eprint = {TR01-026},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR01-026.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR01-047,
author = {Piotr Berman and
Sridhar Hannenhalli and
Marek Karpinski},
title = {1.375-Approximation Algorithm for Sorting by Reversals},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR01-047}},
year = {2001},
url = {https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-047/index.html},
eprinttype = {ECCC},
eprint = {TR01-047},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR01-047.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR01-053,
author = {Piotr Berman and
Marek Karpinski},
title = {Efficient Amplifiers and Bounded Degree Optimization},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR01-053}},
year = {2001},
url = {https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-053/index.html},
eprinttype = {ECCC},
eprint = {TR01-053},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR01-053.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR01-054,
author = {Piotr Berman and
Amir Ben{-}Dor and
Itsik Pe'er and
Roded Sharan and
Ron Shamir},
title = {On the Complexity of Positional Sequencing by Hybridization},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR01-054}},
year = {2001},
url = {https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-054/index.html},
eprinttype = {ECCC},
eprint = {TR01-054},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR01-054.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR01-097,
author = {Piotr Berman and
Marek Karpinski},
title = {Improved Approximations for General Minimum Cost Scheduling},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR01-097}},
year = {2001},
url = {https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-097/index.html},
eprinttype = {ECCC},
eprint = {TR01-097},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR01-097.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BermanCK00,
author = {Piotr Berman and
Moses Charikar and
Marek Karpinski},
title = {On-Line Load Balancing for Related Machines},
journal = {J. Algorithms},
volume = {35},
number = {1},
pages = {108--121},
year = {2000},
url = {https://doi.org/10.1006/jagm.1999.1070},
doi = {10.1006/JAGM.1999.1070},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BermanCK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/BermanZWKM00,
author = {Piotr Berman and
Zheng Zhang and
Yuri I. Wolf and
Eugene V. Koonin and
Webb Miller},
title = {Winnowing Sequences from a Database Search},
journal = {J. Comput. Biol.},
volume = {7},
number = {1-2},
pages = {293--302},
year = {2000},
url = {https://doi.org/10.1089/10665270050081531},
doi = {10.1089/10665270050081531},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcb/BermanZWKM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BermanD00,
author = {Piotr Berman and
Bhaskar DasGupta},
title = {Multi-phase Algorithms for Throughput Maximization for Real-Time Scheduling},
journal = {J. Comb. Optim.},
volume = {4},
number = {3},
pages = {307--323},
year = {2000},
url = {https://doi.org/10.1023/A:1009822211065},
doi = {10.1023/A:1009822211065},
timestamp = {Thu, 18 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/BermanD00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/Berman00,
author = {Piotr Berman},
title = {A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free
Graphs},
journal = {Nord. J. Comput.},
volume = {7},
number = {3},
pages = {178--184},
year = {2000},
timestamp = {Wed, 14 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/njc/Berman00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcad/BermanKVWZ00,
author = {Piotr Berman and
Andrew B. Kahng and
Devendra Vidhani and
Huijuan Wang and
Alexander Zelikovsky},
title = {Optimal phase conflict removal for layout of dark field alternatingphase
shifting masks},
journal = {{IEEE} Trans. Comput. Aided Des. Integr. Circuits Syst.},
volume = {19},
number = {2},
pages = {175--187},
year = {2000},
url = {https://doi.org/10.1109/43.828546},
doi = {10.1109/43.828546},
timestamp = {Thu, 24 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcad/BermanKVWZ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BermanF00,
author = {Piotr Berman and
Junichiro Fukuyama},
editor = {Klaus Jansen and
Samir Khuller},
title = {Variable length sequencing with two lengths},
booktitle = {Approximation Algorithms for Combinatorial Optimization, Third International
Workshop, {APPROX} 2000, Saarbr{\"{u}}cken, Germany, September
5-8, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1913},
pages = {51--59},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44436-X\_7},
doi = {10.1007/3-540-44436-X\_7},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/BermanF00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BermanD00,
author = {Piotr Berman and
Bhaskar DasGupta},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Improvements in throughout maximization for real-time scheduling},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {680--687},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335401},
doi = {10.1145/335305.335401},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BermanD00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Berman00,
author = {Piotr Berman},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {A \emph{d}/2 Approximation for Maximum Weight Independent Set in \emph{d}-Claw
Free Graphs},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {214--219},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_19},
doi = {10.1007/3-540-44985-X\_19},
timestamp = {Fri, 27 Mar 2020 08:50:36 +0100},
biburl = {https://dblp.org/rec/conf/swat/Berman00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR00-001,
author = {Piotr Berman and
Moses Charikar and
Marek Karpinski},
title = {On-Line Load Balancing for Related Machines},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR00-001}},
year = {2000},
url = {https://eccc.weizmann.ac.il/eccc-reports/2000/TR00-001/index.html},
eprinttype = {ECCC},
eprint = {TR00-001},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR00-001.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bioinformatics/ZhangBWM99,
author = {Zheng Zhang and
Piotr Berman and
Thomas Wiehe and
Webb Miller},
title = {Post-processing long pairwise alignments},
journal = {Bioinform.},
volume = {15},
number = {12},
pages = {1012--1019},
year = {1999},
url = {https://doi.org/10.1093/bioinformatics/15.12.1012},
doi = {10.1093/BIOINFORMATICS/15.12.1012},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/bioinformatics/ZhangBWM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BermanF99,
author = {Piotr Berman and
Toshihiro Fujito},
title = {On Approximation Properties of the Independent Set Problem for Low
Degree Graphs},
journal = {Theory Comput. Syst.},
volume = {32},
number = {2},
pages = {115--132},
year = {1999},
url = {https://doi.org/10.1007/s002240000113},
doi = {10.1007/S002240000113},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BermanF99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/BermanC99,
author = {Piotr Berman and
Chris Coulston},
title = {Speed is More Powerful than Clairvoyance},
journal = {Nord. J. Comput.},
volume = {6},
number = {2},
pages = {181--193},
year = {1999},
timestamp = {Wed, 14 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/njc/BermanC99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BafnaBF99,
author = {Vineet Bafna and
Piotr Berman and
Toshihiro Fujito},
title = {A 2-Approximation Algorithm for the Undirected Feedback Vertex Set
Problem},
journal = {{SIAM} J. Discret. Math.},
volume = {12},
number = {3},
pages = {289--297},
year = {1999},
url = {https://doi.org/10.1137/S0895480196305124},
doi = {10.1137/S0895480196305124},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/BafnaBF99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BermanK99,
author = {Piotr Berman and
Marek Karpinski},
editor = {Jir{\'{\i}} Wiedermann and
Peter van Emde Boas and
Mogens Nielsen},
title = {On Some Tighter Inapproximability Results (Extended Abstract)},
booktitle = {Automata, Languages and Programming, 26th International Colloquium,
ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1644},
pages = {200--209},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48523-6\_17},
doi = {10.1007/3-540-48523-6\_17},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BermanK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ispd/BermanKVWZ99,
author = {Piotr Berman and
Andrew B. Kahng and
Devendra Vidhani and
Huijuan Wang and
Alexander Zelikovsky},
editor = {D. F. Wong},
title = {Optimal phase conflict removal for layout of dark field alternating
phase shifting masks},
booktitle = {Proceedings of the 1999 International Symposium on Physical Design,
{ISPD} 1999, Monterey, CA, USA, April 12-14, 1999},
pages = {121--126},
publisher = {{ACM}},
year = {1999},
url = {https://doi.org/10.1145/299996.300037},
doi = {10.1145/299996.300037},
timestamp = {Sun, 02 Oct 2022 16:10:02 +0200},
biburl = {https://dblp.org/rec/conf/ispd/BermanKVWZ99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recomb/BermanZWKM99,
author = {Piotr Berman and
Zheng Zhang and
Yuri I. Wolf and
Eugene V. Koonin and
Webb Miller},
editor = {Sorin Istrail and
Pavel A. Pevzner and
Michael S. Waterman},
title = {Winnowing sequences from a database search},
booktitle = {Proceedings of the Third Annual International Conference on Research
in Computational Molecular Biology, {RECOMB} 1999, Lyon, France, April
11-14, 1999},
pages = {50--58},
publisher = {{ACM}},
year = {1999},
url = {https://doi.org/10.1145/299432.299451},
doi = {10.1145/299432.299451},
timestamp = {Mon, 13 May 2019 09:30:09 +0200},
biburl = {https://dblp.org/rec/conf/recomb/BermanZWKM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BermanKVZ99,
author = {Piotr Berman and
Andrew B. Kahng and
Devendra Vidhani and
Alexander Zelikovsky},
editor = {Frank K. H. A. Dehne and
Arvind Gupta and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Roberto Tamassia},
title = {The T-join Problem in Sparse Graphs: Applications to Phase Assignment
Problem in {VLSI} Mask Layout},
booktitle = {Algorithms and Data Structures, 6th International Workshop, {WADS}
'99, Vancouver, British Columbia, Canada, August 11-14, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1663},
pages = {25--36},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48447-7\_3},
doi = {10.1007/3-540-48447-7\_3},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BermanKVZ99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/ZhangBM98,
author = {Zheng Zhang and
Piotr Berman and
Webb Miller},
title = {Alignments without Low-Scoring Regions},
journal = {J. Comput. Biol.},
volume = {5},
number = {2},
pages = {197--210},
year = {1998},
url = {https://doi.org/10.1089/cmb.1998.5.197},
doi = {10.1089/CMB.1998.5.197},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcb/ZhangBM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BermanG98,
author = {Piotr Berman and
Juan A. Garay},
editor = {Gianfranco Bilardi and
Giuseppe F. Italiano and
Andrea Pietracaprina and
Geppino Pucci},
title = {Adaptability and the Usefulness of Hints (Extended Abstract)},
booktitle = {Algorithms - {ESA} '98, 6th Annual European Symposium, Venice, Italy,
August 24-26, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1461},
pages = {271--282},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/3-540-68530-8\_23},
doi = {10.1007/3-540-68530-8\_23},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/BermanG98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recomb/ZhangBM98,
author = {Zheng Zhang and
Piotr Berman and
Webb Miller},
editor = {Sorin Istrail and
Pavel A. Pevzner and
Michael S. Waterman},
title = {Alignments without low-scoring regions},
booktitle = {Proceedings of the Second Annual International Conference on Research
in Computational Molecular Biology, {RECOMB} 1998, New York, NY, USA,
March 22-25, 1998},
pages = {294--301},
publisher = {{ACM}},
year = {1998},
url = {https://doi.org/10.1145/279069.279137},
doi = {10.1145/279069.279137},
timestamp = {Mon, 13 May 2019 09:30:09 +0200},
biburl = {https://dblp.org/rec/conf/recomb/ZhangBM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BermanC98,
author = {Piotr Berman and
Chris Coulston},
editor = {Stefan Arnborg and
Lars Ivansson},
title = {Speed is More Powerful than Claivoyance},
booktitle = {Algorithm Theory - {SWAT} '98, 6th Scandinavian Workshop on Algorithm
Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1432},
pages = {255--263},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054373},
doi = {10.1007/BFB0054373},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/BermanC98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR98-029,
author = {Piotr Berman and
Marek Karpinski},
title = {On Some Tighter Inapproximability Results},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR98-029}},
year = {1998},
url = {https://eccc.weizmann.ac.il/eccc-reports/1998/TR98-029/index.html},
eprinttype = {ECCC},
eprint = {TR98-029},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR98-029.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR98-065,
author = {Piotr Berman and
Marek Karpinski},
title = {On Some Tighter Inapproximability Results, Further Improvements},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR98-065}},
year = {1998},
url = {https://eccc.weizmann.ac.il/eccc-reports/1998/TR98-065/index.html},
eprinttype = {ECCC},
eprint = {TR98-065},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR98-065.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BermanD97,
author = {Piotr Berman and
Bhaskar DasGupta},
title = {Complexities of Efficient Solutions of Rectilinear Polygon Cover Problems},
journal = {Algorithmica},
volume = {17},
number = {4},
pages = {331--356},
year = {1997},
url = {https://doi.org/10.1007/BF02523677},
doi = {10.1007/BF02523677},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BermanD97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BermanDP97,
author = {Piotr Berman and
Krzysztof Diks and
Andrzej Pelc},
title = {Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures},
journal = {J. Algorithms},
volume = {22},
number = {2},
pages = {199--211},
year = {1997},
url = {https://doi.org/10.1006/jagm.1996.0810},
doi = {10.1006/JAGM.1996.0810},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BermanDP97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BermanL97,
author = {Piotr Berman and
Andrzej Lingas},
title = {A Nearly Optimal Parallel Algorithm for the Voronoi Diagram of a Convex
Polygon},
journal = {Theor. Comput. Sci.},
volume = {174},
number = {1-2},
pages = {193--202},
year = {1997},
url = {https://doi.org/10.1016/S0304-3975(96)00024-2},
doi = {10.1016/S0304-3975(96)00024-2},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BermanL97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BermanKLPR97,
author = {Piotr Berman and
Marek Karpinski and
Lawrence L. Larmore and
Wojciech Plandowski and
Wojciech Rytter},
editor = {Alberto Apostolico and
Jotun Hein},
title = {On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional
Texts},
booktitle = {Combinatorial Pattern Matching, 8th Annual Symposium, {CPM} 97, Aarhus,
Denmark, June 30 - July 2, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1264},
pages = {40--51},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63220-4\_48},
doi = {10.1007/3-540-63220-4\_48},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BermanKLPR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/BermanG97,
author = {Piotr Berman and
Juan A. Garay},
editor = {James E. Burns and
Hagit Attiya},
title = {Competing against Specialists},
booktitle = {Proceedings of the Sixteenth Annual {ACM} Symposium on Principles
of Distributed Computing, Santa Barbara, California, USA, August 21-24,
1997},
pages = {284},
publisher = {{ACM}},
year = {1997},
url = {https://doi.org/10.1145/259380.259491},
doi = {10.1145/259380.259491},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/BermanG97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BermanC97,
author = {Piotr Berman and
Chris Coulston},
editor = {Frank Thomson Leighton and
Peter W. Shor},
title = {On-Line Algorithms for Steiner Tree Problems (Extended Abstract)},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM} Symposium on the Theory
of Computing, El Paso, Texas, USA, May 4-6, 1997},
pages = {344--353},
publisher = {{ACM}},
year = {1997},
url = {https://doi.org/10.1145/258533.258618},
doi = {10.1145/258533.258618},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BermanC97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BermanCK97,
author = {Piotr Berman and
Moses Charikar and
Marek Karpinski},
editor = {Frank K. H. A. Dehne and
Andrew Rau{-}Chaplin and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Roberto Tamassia},
title = {On-line Load Balancing for Related Machines},
booktitle = {Algorithms and Data Structures, 5th International Workshop, {WADS}
'97, Halifax, Nova Scotia, Canada, August 6-8, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1272},
pages = {116--125},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63307-3\_52},
doi = {10.1007/3-540-63307-3\_52},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BermanCK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/StojanovicBGHM97,
author = {Nikola Stojanovic and
Piotr Berman and
Deborah Gumucio and
Ross C. Hardison and
Webb Miller},
editor = {Frank K. H. A. Dehne and
Andrew Rau{-}Chaplin and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Roberto Tamassia},
title = {A Linear-Time Algorithm for the 1-Mismatch Problem},
booktitle = {Algorithms and Data Structures, 5th International Workshop, {WADS}
'97, Halifax, Nova Scotia, Canada, August 6-8, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1272},
pages = {126--135},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63307-3\_53},
doi = {10.1007/3-540-63307-3\_53},
timestamp = {Sun, 21 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/StojanovicBGHM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BermanH96,
author = {Piotr Berman and
Sridhar Hannenhalli},
editor = {Daniel S. Hirschberg and
Eugene W. Myers},
title = {Fast Sorting by Reversal},
booktitle = {Combinatorial Pattern Matching, 7th Annual Symposium, {CPM} 96, Laguna
Beach, California, USA, June 10-12, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1075},
pages = {168--185},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61258-0\_14},
doi = {10.1007/3-540-61258-0\_14},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BermanH96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/Berman96,
author = {Piotr Berman},
editor = {Amos Fiat and
Gerhard J. Woeginger},
title = {On-line Searching and Navigation},
booktitle = {Online Algorithms, The State of the Art (the book grow out of a Dagstuhl
Seminar, June 1996)},
series = {Lecture Notes in Computer Science},
volume = {1442},
pages = {232--241},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/BFb0029571},
doi = {10.1007/BFB0029571},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/Berman96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BermanBFKRS96,
author = {Piotr Berman and
Avrim Blum and
Amos Fiat and
Howard J. Karloff and
Adi Ros{\'{e}}n and
Michael E. Saks},
editor = {{\'{E}}va Tardos},
title = {Randomized Robot Navigation Algorithms},
booktitle = {Proceedings of the Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, 28-30 January 1996, Atlanta, Georgia, {USA}},
pages = {75--84},
publisher = {{ACM/SIAM}},
year = {1996},
url = {http://dl.acm.org/citation.cfm?id=313852.313890},
timestamp = {Thu, 05 Jul 2018 07:29:31 +0200},
biburl = {https://dblp.org/rec/conf/soda/BermanBFKRS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BafnaBF95,
author = {Vineet Bafna and
Piotr Berman and
Toshihiro Fujito},
editor = {John Staples and
Peter Eades and
Naoki Katoh and
Alistair Moffat},
title = {Constant Ratio Approximations of the Weighted Feedback Vertex Set
Problem for Undirected Graphs},
booktitle = {Algorithms and Computation, 6th International Symposium, {ISAAC} '95,
Cairns, Australia, December 4-6, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1004},
pages = {142--151},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/BFb0015417},
doi = {10.1007/BFB0015417},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BafnaBF95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BermanF95,
author = {Piotr Berman and
Toshihiro Fujito},
editor = {Selim G. Akl and
Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro},
title = {On the Approximation Properties of Independent Set Problem in Degree
3 Graphs},
booktitle = {Algorithms and Data Structures, 4th International Workshop, {WADS}
'95, Kingston, Ontario, Canada, August 16-18, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {955},
pages = {449--460},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60220-8\_84},
doi = {10.1007/3-540-60220-8\_84},
timestamp = {Sun, 02 Jun 2019 21:24:17 +0200},
biburl = {https://dblp.org/rec/conf/wads/BermanF95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Bar-EliBFY94,
author = {Eldad Bar{-}Eli and
Piotr Berman and
Amos Fiat and
Peiyuan Yan},
title = {Online Navigation in a Room},
journal = {J. Algorithms},
volume = {17},
number = {3},
pages = {319--341},
year = {1994},
url = {https://doi.org/10.1006/jagm.1994.1039},
doi = {10.1006/JAGM.1994.1039},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Bar-EliBFY94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BermanR94,
author = {Piotr Berman and
Viswanathan Ramaiyer},
title = {Improved Approximations for the Steiner Tree Problem},
journal = {J. Algorithms},
volume = {17},
number = {3},
pages = {381--408},
year = {1994},
url = {https://doi.org/10.1006/jagm.1994.1041},
doi = {10.1006/JAGM.1994.1041},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BermanR94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BermanP94,
author = {Piotr Berman and
Andrzej Pelc},
title = {Reliable distributed diagnosis for multiprocessor systems with random
faults},
journal = {Networks},
volume = {24},
number = {8},
pages = {417--427},
year = {1994},
url = {https://doi.org/10.1002/net.3230240803},
doi = {10.1002/NET.3230240803},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BermanP94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tpds/SpasojevicB94,
author = {Mirjana Spasojevic and
Piotr Berman},
title = {Voting as the Optimal Static Pessimistic Scheme for Managing Replicated
Data},
journal = {{IEEE} Trans. Parallel Distributed Syst.},
volume = {5},
number = {1},
pages = {64--73},
year = {1994},
url = {https://doi.org/10.1109/71.262589},
doi = {10.1109/71.262589},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tpds/SpasojevicB94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BermanFKKZ94,
author = {Piotr Berman and
Ulrich F{\"{o}}{\ss}meier and
Marek Karpinski and
Michael Kaufmann and
Alexander Zelikovsky},
editor = {Jan van Leeuwen},
title = {Approaching the 5/4-Approximation for Rectilinear Steiner Trees},
booktitle = {Algorithms - {ESA} '94, Second Annual European Symposium, Utrecht,
The Netherlands, September 26-28, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {855},
pages = {60--71},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/BFb0049397},
doi = {10.1007/BFB0049397},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/BermanFKKZ94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BermanF94,
author = {Piotr Berman and
Martin F{\"{u}}rer},
editor = {Daniel Dominic Sleator},
title = {Approximating Maximum Independent Set in Bounded Degree Graphs},
booktitle = {Proceedings of the Fifth Annual {ACM-SIAM} Symposium on Discrete Algorithms.
23-25 January 1994, Arlington, Virginia, {USA}},
pages = {365--371},
publisher = {{ACM/SIAM}},
year = {1994},
url = {http://dl.acm.org/citation.cfm?id=314464.314570},
timestamp = {Thu, 05 Jul 2018 07:29:19 +0200},
biburl = {https://dblp.org/rec/conf/soda/BermanF94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BermanL94,
author = {Piotr Berman and
Andrzej Lingas},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {A Nearly Optimal Parallel Algorithm for the Voronoi Diagram of a Convex
Polygon},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {73--82},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_7},
doi = {10.1007/3-540-58218-5\_7},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/BermanL94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dc/BermanG93,
author = {Piotr Berman and
Juan A. Garay},
title = {Fast Consensus in Networks of Bounded Degree},
journal = {Distributed Comput.},
volume = {7},
number = {2},
pages = {67--73},
year = {1993},
url = {https://doi.org/10.1007/BF02280836},
doi = {10.1007/BF02280836},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dc/BermanG93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BermanG93,
author = {Piotr Berman and
Juan A. Garay},
title = {Cloture Votes: n/4-Resilient Distributed Consensus in t+1 Rounds},
journal = {Math. Syst. Theory},
volume = {26},
number = {1},
pages = {3--19},
year = {1993},
url = {https://doi.org/10.1007/BF01187072},
doi = {10.1007/BF01187072},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BermanG93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ftcs/BermanG93,
author = {Piotr Berman and
Juan A. Garay},
title = {Randomized Distributed Agreement Revisited},
booktitle = {Digest of Papers: FTCS-23, The Twenty-Third Annual International Symposium
on Fault-Tolerant Computing, Toulouse, France, June 22-24, 1993},
pages = {412--419},
publisher = {{IEEE} Computer Society},
year = {1993},
url = {https://doi.org/10.1109/FTCS.1993.627344},
doi = {10.1109/FTCS.1993.627344},
timestamp = {Wed, 16 Oct 2019 14:14:57 +0200},
biburl = {https://dblp.org/rec/conf/ftcs/BermanG93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/BermanB93,
author = {Piotr Berman and
Anupam A. Bharali},
editor = {Andr{\'{e}} Schiper},
title = {Quick Atomic Broadcast (Extended Abstract)},
booktitle = {Distributed Algorithms, 7th International Workshop, {WDAG} '93, Lausanne,
Switzerland, September 27-29, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {725},
pages = {189--203},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57271-6\_36},
doi = {10.1007/3-540-57271-6\_36},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/wdag/BermanB93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BermanS92,
author = {Piotr Berman and
Georg Schnitger},
title = {On the Complexity of Approximating the Independent Set Problem},
journal = {Inf. Comput.},
volume = {96},
number = {1},
pages = {77--94},
year = {1992},
url = {https://doi.org/10.1016/0890-5401(92)90056-L},
doi = {10.1016/0890-5401(92)90056-L},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BermanS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tnn/BermanPS92,
author = {Piotr Berman and
Ian Parberry and
Georg Schnitger},
title = {A note on the complexity of reliability in neural networks},
journal = {{IEEE} Trans. Neural Networks},
volume = {3},
number = {6},
pages = {998--1002},
year = {1992},
url = {https://doi.org/10.1109/72.165601},
doi = {10.1109/72.165601},
timestamp = {Sat, 30 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tnn/BermanPS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/BermanB92,
author = {Piotr Berman and
Anupam A. Bharali},
editor = {Viktor K. Prasanna and
Larry H. Canter},
title = {Distributed Consensus in Semi-Synchronous Systems},
booktitle = {Proceedings of the 6th International Parallel Processing Symposium,
Beverly Hills, CA, USA, March 1992},
pages = {632--635},
publisher = {{IEEE} Computer Society},
year = {1992},
url = {https://doi.org/10.1109/IPPS.1992.222994},
doi = {10.1109/IPPS.1992.222994},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipps/BermanB92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Bar-EliBFY92,
author = {Eldad Bar{-}Eli and
Piotr Berman and
Amos Fiat and
Peiyuan Yan},
editor = {Greg N. Frederickson},
title = {On-Line Navigation in a Room},
booktitle = {Proceedings of the Third Annual {ACM/SIGACT-SIAM} Symposium on Discrete
Algorithms, 27-29 January 1992, Orlando, Florida, {USA}},
pages = {237--249},
publisher = {{ACM/SIAM}},
year = {1992},
url = {http://dl.acm.org/citation.cfm?id=139404.139456},
timestamp = {Thu, 05 Jul 2018 07:29:02 +0200},
biburl = {https://dblp.org/rec/conf/soda/Bar-EliBFY92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BermanR92,
author = {Piotr Berman and
Viswanathan Ramaiyer},
editor = {Greg N. Frederickson},
title = {Improved Approximations for the Steiner Tree Problem},
booktitle = {Proceedings of the Third Annual {ACM/SIGACT-SIAM} Symposium on Discrete
Algorithms, 27-29 January 1992, Orlando, Florida, {USA}},
pages = {325--334},
publisher = {{ACM/SIAM}},
year = {1992},
url = {http://dl.acm.org/citation.cfm?id=139404.139471},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/BermanR92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/BermanGP92,
author = {Piotr Berman and
Juan A. Garay and
Kenneth J. Perry},
editor = {Adrian Segall and
Shmuel Zaks},
title = {Optimal Early Stopping in Distributed Consensus (Extended Abstract)},
booktitle = {Distributed Algorithms, 6th International Workshop, {WDAG} '92, Haifa,
Israel, November 2-4, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {647},
pages = {221--237},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56188-9\_15},
doi = {10.1007/3-540-56188-9\_15},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/wdag/BermanGP92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/BermanG91,
author = {Piotr Berman and
Juan A. Garay},
editor = {Sam Toueg and
Paul G. Spirakis and
Lefteris M. Kirousis},
title = {Efficient Distributed Consensus with n = {(3} + epsilon) t Processors
(Extended Abstract)},
booktitle = {Distributed Algorithms, 5th International Workshop, {WDAG} '91, Delphi,
Greece, October 7-9, 1991, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {579},
pages = {129--142},
publisher = {Springer},
year = {1991},
url = {https://doi.org/10.1007/BFb0022442},
doi = {10.1007/BFB0022442},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/wdag/BermanG91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ftcs/BermanP90,
author = {Piotr Berman and
Andrzej Pelc},
title = {Distributed probabilistic fault diagnosis for multiprocessor systems},
booktitle = {Proceedings of the 20th International Symposium on Fault-Tolerant
Computing, {FTCS} 1990, Newcastle Upon Tyne, UK, 26-28 June, 1990},
pages = {340--346},
publisher = {{IEEE} Computer Society},
year = {1990},
url = {https://doi.org/10.1109/FTCS.1990.89383},
doi = {10.1109/FTCS.1990.89383},
timestamp = {Wed, 16 Oct 2019 14:14:57 +0200},
biburl = {https://dblp.org/rec/conf/ftcs/BermanP90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BermanKT90,
author = {Piotr Berman and
Howard J. Karloff and
G{\'{a}}bor Tardos},
editor = {David S. Johnson},
title = {A Competitive 3-Server Algorithm},
booktitle = {Proceedings of the First Annual {ACM-SIAM} Symposium on Discrete Algorithms,
22-24 January 1990, San Francisco, California, {USA}},
pages = {280--290},
publisher = {{SIAM}},
year = {1990},
url = {http://dl.acm.org/citation.cfm?id=320176.320208},
timestamp = {Thu, 05 Jul 2018 07:28:50 +0200},
biburl = {https://dblp.org/rec/conf/soda/BermanKT90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/srds/ObradovicB90,
author = {Mirjana Obradovic and
Piotr Berman},
title = {Voting as the Optimal Static Pessimistic Scheme for Managing Replicated
Data},
booktitle = {Ninth Symposium on Reliable Distributed Systems, {SRDS} 1990, Huntsville,
Alabama, USA, October 9-11, 1990, Proceedings},
pages = {126--135},
publisher = {{IEEE} Computer Society},
year = {1990},
url = {https://doi.org/10.1109/RELDIS.1990.93958},
doi = {10.1109/RELDIS.1990.93958},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/srds/ObradovicB90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/ObradovicB90,
author = {Mirjana Obradovic and
Piotr Berman},
editor = {Jan van Leeuwen and
Nicola Santoro},
title = {Weighted Voting for Operation Dependent Management of Replicated Data},
booktitle = {Distributed Algorithms, 4th International Workshop, {WDAG} '90, Bari,
Italy, September 24-26, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {486},
pages = {263--276},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-54099-7\_18},
doi = {10.1007/3-540-54099-7\_18},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/wdag/ObradovicB90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/BermanG90,
author = {Piotr Berman and
Juan A. Garay},
editor = {Jan van Leeuwen and
Nicola Santoro},
title = {Fast Consensus in Networks of Bounded Degree (Extended Abstract)},
booktitle = {Distributed Algorithms, 4th International Workshop, {WDAG} '90, Bari,
Italy, September 24-26, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {486},
pages = {321--333},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-54099-7\_22},
doi = {10.1007/3-540-54099-7\_22},
timestamp = {Fri, 19 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wdag/BermanG90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BermanGP89,
author = {Piotr Berman and
Juan A. Garay and
Kenneth J. Perry},
title = {Towards Optimal Distributed Consensus (Extended Abstract)},
booktitle = {30th Annual Symposium on Foundations of Computer Science, Research
Triangle Park, North Carolina, USA, 30 October - 1 November 1989},
pages = {410--415},
publisher = {{IEEE} Computer Society},
year = {1989},
url = {https://doi.org/10.1109/SFCS.1989.63511},
doi = {10.1109/SFCS.1989.63511},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BermanGP89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BermanG89,
author = {Piotr Berman and
Juan A. Garay},
editor = {Giorgio Ausiello and
Mariangiola Dezani{-}Ciancaglini and
Simona Ronchi Della Rocca},
title = {Asymptotically Optimal Distributed Consensus (Extended Abstract)},
booktitle = {Automata, Languages and Programming, 16th International Colloquium,
ICALP89, Stresa, Italy, July 11-15, 1989, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {372},
pages = {80--94},
publisher = {Springer},
year = {1989},
url = {https://doi.org/10.1007/BFb0035753},
doi = {10.1007/BFB0035753},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BermanG89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icpp/BermanG89,
author = {Piotr Berman and
Juan A. Garay},
title = {Efficient Agreement on Bounded-Degree Networks},
booktitle = {Proceedings of the International Conference on Parallel Processing,
{ICPP} '89, The Pennsylvania State University, University Park, PA,
USA, August 1989. Volume 1: Architecture},
pages = {188--191},
publisher = {Pennsylvania State University Press},
year = {1989},
timestamp = {Mon, 28 Jul 2014 17:06:00 +0200},
biburl = {https://dblp.org/rec/conf/icpp/BermanG89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BermanS89,
author = {Piotr Berman and
Georg Schnitger},
editor = {Burkhard Monien and
Robert Cori},
title = {On the Complexity of Approximating the Independent Set Problem},
booktitle = {{STACS} 89, 6th Annual Symposium on Theoretical Aspects of Computer
Science, Paderborn, FRG, February 16-18, 1989, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {349},
pages = {256--268},
publisher = {Springer},
year = {1989},
url = {https://doi.org/10.1007/BFb0028990},
doi = {10.1007/BFB0028990},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BermanS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BermanS88,
author = {Piotr Berman and
Janos Simon},
editor = {Janos Simon},
title = {Investigations of Fault-Tolerant Networks of Computers (Preliminary
Version)},
booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing,
May 2-4, 1988, Chicago, Illinois, {USA}},
pages = {66--77},
publisher = {{ACM}},
year = {1988},
url = {https://doi.org/10.1145/62212.62219},
doi = {10.1145/62212.62219},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BermanS88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BermanR87,
author = {Piotr Berman and
Robert Roos},
title = {Learning One-Counter Languages in Polynomial Time (Extended Abstract)},
booktitle = {28th Annual Symposium on Foundations of Computer Science, Los Angeles,
California, USA, 27-29 October 1987},
pages = {61--67},
publisher = {{IEEE} Computer Society},
year = {1987},
url = {https://doi.org/10.1109/SFCS.1987.36},
doi = {10.1109/SFCS.1987.36},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BermanR87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ismis/BermanR87,
author = {Piotr Berman and
Robert Roos},
editor = {Zbigniew W. Ras and
Maria Zemankova},
title = {A Learning Algorithm for a Class of Context-Free Languages (Extended
Abstract)},
booktitle = {Methodologies for Intelligent Systems, Proceedings of the Second International
Symposium, Charlotte, North Carolina, USA, October 14-17, 1987},
pages = {317--324},
publisher = {North-Holland/Elsevier},
year = {1987},
timestamp = {Mon, 22 May 2017 09:57:27 +0200},
biburl = {https://dblp.org/rec/conf/ismis/BermanR87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/Berman83,
author = {Piotr Berman},
editor = {Marek Karpinski},
title = {Deterministic Dynamic Logic of Recursive Programs is Weaker than Dynamic
Logic},
booktitle = {Fundamentals of Computation Theory, Proceedings of the 1983 International
FCT-Conference, Borgholm, Sweden, August 21-27, 1983},
series = {Lecture Notes in Computer Science},
volume = {158},
pages = {14--25},
publisher = {Springer},
year = {1983},
url = {https://doi.org/10.1007/3-540-12689-9\_90},
doi = {10.1007/3-540-12689-9\_90},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/Berman83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BermanS83,
author = {Piotr Berman and
Janos Simon},
title = {Lower Bounds on Graph Threading by Probabilistic Machines (Preliminary
Version)},
booktitle = {24th Annual Symposium on Foundations of Computer Science, Tucson,
Arizona, USA, 7-9 November 1983},
pages = {304--311},
publisher = {{IEEE} Computer Society},
year = {1983},
url = {https://doi.org/10.1109/SFCS.1983.31},
doi = {10.1109/SFCS.1983.31},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BermanS83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BermanHT82,
author = {Piotr Berman and
Joseph Y. Halpern and
Jerzy Tiuryn},
editor = {Mogens Nielsen and
Erik Meineche Schmidt},
title = {On the Power of Nondeterminism in Dynamic Logic},
booktitle = {Automata, Languages and Programming, 9th Colloquium, Aarhus, Denmark,
July 12-16, 1982, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {140},
pages = {48--60},
publisher = {Springer},
year = {1982},
url = {https://doi.org/10.1007/BFb0012756},
doi = {10.1007/BFB0012756},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BermanHT82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Berman80,
author = {Piotr Berman},
editor = {J. W. de Bakker and
Jan van Leeuwen},
title = {A Note on Sweeping Automata},
booktitle = {Automata, Languages and Programming, 7th Colloquium, Noordweijkerhout,
The Netherlands, July 14-18, 1980, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {85},
pages = {91--97},
publisher = {Springer},
year = {1980},
url = {https://doi.org/10.1007/3-540-10003-2\_62},
doi = {10.1007/3-540-10003-2\_62},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Berman80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Berman78,
author = {Piotr Berman},
editor = {Giorgio Ausiello and
Corrado B{\"{o}}hm},
title = {Relationship Between Density and Deterministic Complexity of NP-Complete
Languages},
booktitle = {Automata, Languages and Programming, Fifth Colloquium, Udine, Italy,
July 17-21, 1978, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {62},
pages = {63--71},
publisher = {Springer},
year = {1978},
url = {https://doi.org/10.1007/3-540-08860-1\_6},
doi = {10.1007/3-540-08860-1\_6},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Berman78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-25 05:44 CEST 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:
