Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

BibTeX records: Omer Berkman

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

> Home > Persons > Omer Berkman

download as .bib file

@inproceedings{DBLP:conf/acns/Ben-DavidBMPPY12,
  author       = {Assaf Ben{-}David and
                  Omer Berkman and
                  Yossi Matias and
                  Sarvar Patel and
                  Cem Paya and
                  Moti Yung},
  editor       = {Feng Bao and
                  Pierangela Samarati and
                  Jianying Zhou},
  title        = {Contextual {OTP:} Mitigating Emerging Man-in-the-Middle Attacks with
                  Wireless Hardware Tokens},
  booktitle    = {Applied Cryptography and Network Security - 10th International Conference,
                  {ACNS} 2012, Singapore, June 26-29, 2012. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7341},
  pages        = {30--47},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-31284-7\_3},
  doi          = {10.1007/978-3-642-31284-7\_3},
  timestamp    = {Fri, 09 Apr 2021 18:46:11 +0200},
  biburl       = {https://dblp.org/rec/conf/acns/Ben-DavidBMPPY12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/cans/BerkmanPY12,
  author       = {Omer Berkman and
                  Benny Pinkas and
                  Moti Yung},
  editor       = {Josef Pieprzyk and
                  Ahmad{-}Reza Sadeghi and
                  Mark Manulis},
  title        = {Firm Grip Handshakes: {A} Tool for Bidirectional Vouching},
  booktitle    = {Cryptology and Network Security, 11th International Conference, {CANS}
                  2012, Darmstadt, Germany, December 12-14, 2012. Proceedings},
  volume       = {7712},
  pages        = {142--157},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-35404-5\_12},
  doi          = {10.1007/978-3-642-35404-5\_12},
  timestamp    = {Sun, 02 Jun 2019 21:12:31 +0200},
  biburl       = {https://dblp.org/rec/conf/cans/BerkmanPY12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/fc/BerkmanO07,
  author       = {Omer Berkman and
                  Odelia Moshe Ostrovsky},
  editor       = {Sven Dietrich and
                  Rachna Dhamija},
  title        = {The Unbearable Lightness of {PIN} Cracking},
  booktitle    = {Financial Cryptography and Data Security, 11th International Conference,
                  {FC} 2007, and 1st International Workshop on Usable Security, {USEC}
                  2007, Scarborough, Trinidad and Tobago, February 12-16, 2007. Revised
                  Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {4886},
  pages        = {224--238},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-77366-5\_20},
  doi          = {10.1007/978-3-540-77366-5\_20},
  timestamp    = {Tue, 14 May 2019 10:00:38 +0200},
  biburl       = {https://dblp.org/rec/conf/fc/BerkmanO07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/mcs/BerkmanI07,
  author       = {Omer Berkman and
                  Nathan Intrator},
  editor       = {Michal Haindl and
                  Josef Kittler and
                  Fabio Roli},
  title        = {Robust Inference in Bayesian Networks with Application to Gene Expression
                  Temporal Data},
  booktitle    = {Multiple Classifier Systems, 7th International Workshop, {MCS} 2007,
                  Prague, Czech Republic, May 23-25, 2007, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4472},
  pages        = {479--489},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-72523-7\_48},
  doi          = {10.1007/978-3-540-72523-7\_48},
  timestamp    = {Tue, 14 May 2019 10:00:51 +0200},
  biburl       = {https://dblp.org/rec/conf/mcs/BerkmanI07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/Ben-AmramBP03,
  author       = {Amir M. Ben{-}Amram and
                  Omer Berkman and
                  Holger Petersen},
  title        = {Element distinctness on one-tape Turing machines: a complete solution},
  journal      = {Acta Informatica},
  volume       = {40},
  number       = {2},
  pages        = {81--94},
  year         = {2003},
  url          = {https://doi.org/10.1007/s00236-003-0125-8},
  doi          = {10.1007/S00236-003-0125-8},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/Ben-AmramBP03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/arscom/BerkmanPR01,
  author       = {Omer Berkman and
                  Michal Parnas and
                  Yehuda Roditty},
  title        = {All Cycles are Edge-Magic},
  journal      = {Ars Comb.},
  volume       = {59},
  year         = {2001},
  timestamp    = {Fri, 12 Dec 2003 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/arscom/BerkmanPR01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/BerkmanPS00,
  author       = {Omer Berkman and
                  Michal Parnas and
                  Jir{\'{\i}} Sgall},
  title        = {Efficient Dynamic Traitor Tracing},
  journal      = {{SIAM} J. Comput.},
  volume       = {30},
  number       = {6},
  pages        = {1802--1828},
  year         = {2000},
  url          = {https://doi.org/10.1137/S0097539700367984},
  doi          = {10.1137/S0097539700367984},
  timestamp    = {Wed, 14 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BerkmanPS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/BerkmanPS00,
  author       = {Omer Berkman and
                  Michal Parnas and
                  Jir{\'{\i}} Sgall},
  editor       = {David B. Shmoys},
  title        = {Efficient dynamic traitor tracing},
  booktitle    = {Proceedings of the Eleventh Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, January 9-11, 2000, San Francisco, CA, {USA}},
  pages        = {586--595},
  publisher    = {{ACM/SIAM}},
  year         = {2000},
  url          = {http://dl.acm.org/citation.cfm?id=338219.338611},
  timestamp    = {Wed, 11 Nov 2015 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/BerkmanPS00.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/BerkmanMR98,
  author       = {Omer Berkman and
                  Yossi Matias and
                  Prabhakar Ragde},
  title        = {Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and
                  Range Minima over Small Domains},
  journal      = {J. Algorithms},
  volume       = {28},
  number       = {2},
  pages        = {197--215},
  year         = {1998},
  url          = {https://doi.org/10.1006/jagm.1997.0905},
  doi          = {10.1006/JAGM.1997.0905},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/BerkmanMR98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ijcga/BerkmanSV96,
  author       = {Omer Berkman and
                  Baruch Schieber and
                  Uzi Vishkin},
  title        = {A fast parallel algorithm for finding the convex hull of a sorted
                  point set},
  journal      = {Int. J. Comput. Geom. Appl.},
  volume       = {6},
  number       = {2},
  pages        = {231--242},
  year         = {1996},
  url          = {https://doi.org/10.1142/S0218195996000162},
  doi          = {10.1142/S0218195996000162},
  timestamp    = {Thu, 04 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijcga/BerkmanSV96.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/BerkmanV95,
  author       = {Omer Berkman and
                  Uzi Vishkin},
  title        = {Almost Fully-parallel Parentheses Matching},
  journal      = {Discret. Appl. Math.},
  volume       = {57},
  number       = {1},
  pages        = {11--28},
  year         = {1995},
  url          = {https://doi.org/10.1016/0166-218X(93)E0137-N},
  doi          = {10.1016/0166-218X(93)E0137-N},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/BerkmanV95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/BerkmanIP95,
  author       = {Omer Berkman and
                  Costas S. Iliopoulos and
                  Kunsoo Park},
  title        = {The Subtree Max Gap Problem with Application to Parallel String Covering},
  journal      = {Inf. Comput.},
  volume       = {123},
  number       = {1},
  pages        = {127--137},
  year         = {1995},
  url          = {https://doi.org/10.1006/inco.1995.1162},
  doi          = {10.1006/INCO.1995.1162},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/BerkmanIP95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ppl/BerkmanM95,
  author       = {Omer Berkman and
                  Yossi Matias},
  title        = {Fast Parallel Algorithms for Minimum and Related Problems with Small
                  Integer Inputs},
  journal      = {Parallel Process. Lett.},
  volume       = {5},
  pages        = {223--230},
  year         = {1995},
  url          = {https://doi.org/10.1142/S0129626495000205},
  doi          = {10.1142/S0129626495000205},
  timestamp    = {Tue, 24 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ppl/BerkmanM95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/ipps/BerkmanM95,
  author       = {Omer Berkman and
                  Yossi Matias},
  title        = {Fast parallel algorithms for minimum and related problems with small
                  integer inputs},
  booktitle    = {Proceedings of {IPPS} '95, The 9th International Parallel Processing
                  Symposium, April 25-28, 1995, Santa Barbara, California, {USA}},
  pages        = {203--207},
  publisher    = {{IEEE} Computer Society},
  year         = {1995},
  url          = {https://doi.org/10.1109/IPPS.1995.395933},
  doi          = {10.1109/IPPS.1995.395933},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/ipps/BerkmanM95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/istcs/BerkmanGM95,
  author       = {Omer Berkman and
                  Phillip B. Gibbons and
                  Yossi Matias},
  title        = {On the Power of Randomization for the Common {PRAM}},
  booktitle    = {Third Israel Symposium on Theory of Computing and Systems, {ISTCS}
                  1995, Tel Aviv, Israel, January 4-6, 1995, Proceedings},
  pages        = {229--240},
  publisher    = {{IEEE} Computer Society},
  year         = {1995},
  url          = {https://doi.org/10.1109/ISTCS.1995.377027},
  doi          = {10.1109/ISTCS.1995.377027},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/istcs/BerkmanGM95.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jcss/BerkmanV94,
  author       = {Omer Berkman and
                  Uzi Vishkin},
  title        = {Finding Level-Ancestors in Trees},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {48},
  number       = {2},
  pages        = {214--230},
  year         = {1994},
  url          = {https://doi.org/10.1016/S0022-0000(05)80002-9},
  doi          = {10.1016/S0022-0000(05)80002-9},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/BerkmanV94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/BerkmanJKTV94,
  author       = {Omer Berkman and
                  Joseph F. J{\'{a}}J{\'{a}} and
                  Sridhar Krishnamurthy and
                  Ramakrishna Thurimella and
                  Uzi Vishkin},
  title        = {Top-Bottom Routing Around a Rectangle is as Easy as Computing Prefix
                  Minima},
  journal      = {{SIAM} J. Comput.},
  volume       = {23},
  number       = {3},
  pages        = {449--465},
  year         = {1994},
  url          = {https://doi.org/10.1137/S0097539791218275},
  doi          = {10.1137/S0097539791218275},
  timestamp    = {Fri, 02 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BerkmanJKTV94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/soda/Ben-AmramBIP94,
  author       = {Amir M. Ben{-}Amram and
                  Omer Berkman and
                  Costas S. Iliopoulos and
                  Kunsoo Park},
  editor       = {Daniel Dominic Sleator},
  title        = {The Subtree Max Gap Problem with Application to Parallel String Covering},
  booktitle    = {Proceedings of the Fifth Annual {ACM-SIAM} Symposium on Discrete Algorithms.
                  23-25 January 1994, Arlington, Virginia, {USA}},
  pages        = {501--510},
  publisher    = {{ACM/SIAM}},
  year         = {1994},
  url          = {http://dl.acm.org/citation.cfm?id=314464.314633},
  timestamp    = {Thu, 05 Jul 2018 07:29:19 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/Ben-AmramBIP94.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/BerkmanV93,
  author       = {Omer Berkman and
                  Uzi Vishkin},
  title        = {On Parallel Integer Merging},
  journal      = {Inf. Comput.},
  volume       = {106},
  number       = {2},
  pages        = {266--285},
  year         = {1993},
  url          = {https://doi.org/10.1006/inco.1993.1056},
  doi          = {10.1006/INCO.1993.1056},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/BerkmanV93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jal/BerkmanSV93,
  author       = {Omer Berkman and
                  Baruch Schieber and
                  Uzi Vishkin},
  title        = {Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All
                  Nearest Smaller Values},
  journal      = {J. Algorithms},
  volume       = {14},
  number       = {3},
  pages        = {344--370},
  year         = {1993},
  url          = {https://doi.org/10.1006/jagm.1993.1018},
  doi          = {10.1006/JAGM.1993.1018},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jal/BerkmanSV93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamcomp/BerkmanV93,
  author       = {Omer Berkman and
                  Uzi Vishkin},
  title        = {Recursive Star-Tree Parallel Data Structure},
  journal      = {{SIAM} J. Comput.},
  volume       = {22},
  number       = {2},
  pages        = {221--242},
  year         = {1993},
  url          = {https://doi.org/10.1137/0222017},
  doi          = {10.1137/0222017},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BerkmanV93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/wads/BerkmanMR93,
  author       = {Omer Berkman and
                  Yossi Matias and
                  Prabhakar Ragde},
  editor       = {Frank K. H. A. Dehne and
                  J{\"{o}}rg{-}R{\"{u}}diger Sack and
                  Nicola Santoro and
                  Sue Whitesides},
  title        = {Triply-Logarithmic Upper and Lower Bounds for Minimum, Range Minima,
                  and Related Problems with Integer Inputs},
  booktitle    = {Algorithms and Data Structures, Third Workshop, {WADS} '93, Montr{\'{e}}al,
                  Canada, August 11-13, 1993, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {709},
  pages        = {175--187},
  publisher    = {Springer},
  year         = {1993},
  url          = {https://doi.org/10.1007/3-540-57155-8\_246},
  doi          = {10.1007/3-540-57155-8\_246},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/wads/BerkmanMR93.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/BerkmanMV92,
  author       = {Omer Berkman and
                  Yossi Matias and
                  Uzi Vishkin},
  title        = {Randomized Range-Maxima in Nearly-Constant Parallel Time},
  journal      = {Comput. Complex.},
  volume       = {2},
  pages        = {350--373},
  year         = {1992},
  url          = {https://doi.org/10.1007/BF01200429},
  doi          = {10.1007/BF01200429},
  timestamp    = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/BerkmanMV92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/isaac/BerkmanMV92,
  author       = {Omer Berkman and
                  Yossi Matias and
                  Uzi Vishkin},
  editor       = {Toshihide Ibaraki and
                  Yasuyoshi Inagaki and
                  Kazuo Iwama and
                  Takao Nishizeki and
                  Masafumi Yamashita},
  title        = {Randomized Range-Maxima inNearly-Constant Parallel Time},
  booktitle    = {Algorithms and Computation, Third International Symposium, {ISAAC}
                  '92, Nagoya, Japan, December 16-18, 1992, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {650},
  pages        = {135--144},
  publisher    = {Springer},
  year         = {1992},
  url          = {https://doi.org/10.1007/3-540-56279-6\_66},
  doi          = {10.1007/3-540-56279-6\_66},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/BerkmanMV92.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@phdthesis{DBLP:phd/il/Berkman91,
  author       = {Omer Berkman},
  title        = {Paradigms for very fast parallel algorithms},
  school       = {Tel Aviv University, Israel},
  year         = {1991},
  url          = {https://tau.primo.exlibrisgroup.com/permalink/972TAU\_INST/bai57q/alma990030737230204146},
  timestamp    = {Fri, 03 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/phd/il/Berkman91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/focs/BerkmanJKTV90,
  author       = {Omer Berkman and
                  Joseph F. J{\'{a}}J{\'{a}} and
                  Sridhar Krishnamurthy and
                  Ramakrishna Thurimella and
                  Uzi Vishkin},
  title        = {Some Triply-Logarithmic Parallel Algorithms (Extended Abstract)},
  booktitle    = {31st Annual Symposium on Foundations of Computer Science, St. Louis,
                  Missouri, USA, October 22-24, 1990, Volume {II}},
  pages        = {871--881},
  publisher    = {{IEEE} Computer Society},
  year         = {1990},
  url          = {https://doi.org/10.1109/FSCS.1990.89611},
  doi          = {10.1109/FSCS.1990.89611},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/BerkmanJKTV90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/focs/BerkmanV89,
  author       = {Omer Berkman and
                  Uzi Vishkin},
  title        = {Recursive *-Tree Parallel Data-Structure (Extended Abstract)},
  booktitle    = {30th Annual Symposium on Foundations of Computer Science, Research
                  Triangle Park, North Carolina, USA, 30 October - 1 November 1989},
  pages        = {196--202},
  publisher    = {{IEEE} Computer Society},
  year         = {1989},
  url          = {https://doi.org/10.1109/SFCS.1989.63478},
  doi          = {10.1109/SFCS.1989.63478},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/BerkmanV89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stoc/BerkmanBGSV89,
  author       = {Omer Berkman and
                  Dany Breslauer and
                  Zvi Galil and
                  Baruch Schieber and
                  Uzi Vishkin},
  editor       = {David S. Johnson},
  title        = {Highly Parallelizable Problems (Extended Abstract)},
  booktitle    = {Proceedings of the 21st Annual {ACM} Symposium on Theory of Computing,
                  May 14-17, 1989, Seattle, Washington, {USA}},
  pages        = {309--319},
  publisher    = {{ACM}},
  year         = {1989},
  url          = {https://doi.org/10.1145/73007.73036},
  doi          = {10.1145/73007.73036},
  timestamp    = {Wed, 24 Nov 2021 12:15:31 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/BerkmanBGSV89.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.