default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOmer Berkman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i1]Liron David, Omer Berkman, Avinatan Hassidim, David Lazarov, Yossi Matias, Moti Yung:
Cryptiny: Compacting Cryptography for Space-Restricted Channels and its Use-case for IoT-E2EE. IACR Cryptol. ePrint Arch. 2024: 1128 (2024)
2010 – 2019
- 2012
- [c13]Assaf Ben-David, Omer Berkman, Yossi Matias, Sarvar Patel, Cem Paya, Moti Yung:
Contextual OTP: Mitigating Emerging Man-in-the-Middle Attacks with Wireless Hardware Tokens. ACNS 2012: 30-47 - [c12]Omer Berkman, Benny Pinkas, Moti Yung:
Firm Grip Handshakes: A Tool for Bidirectional Vouching. CANS 2012: 142-157
2000 – 2009
- 2007
- [c11]Omer Berkman, Odelia Moshe Ostrovsky:
The Unbearable Lightness of PIN Cracking. Financial Cryptography 2007: 224-238 - [c10]Omer Berkman
, Nathan Intrator:
Robust Inference in Bayesian Networks with Application to Gene Expression Temporal Data. MCS 2007: 479-489 - 2003
- [j14]Amir M. Ben-Amram, Omer Berkman, Holger Petersen:
Element distinctness on one-tape Turing machines: a complete solution. Acta Informatica 40(2): 81-94 (2003) - 2001
- [j13]Omer Berkman, Michal Parnas, Yehuda Roditty:
All Cycles are Edge-Magic. Ars Comb. 59 (2001) - 2000
- [j12]Omer Berkman, Michal Parnas, Jirí Sgall:
Efficient Dynamic Traitor Tracing. SIAM J. Comput. 30(6): 1802-1828 (2000) - [c9]Omer Berkman, Michal Parnas, Jirí Sgall:
Efficient dynamic traitor tracing. SODA 2000: 586-595
1990 – 1999
- 1998
- [j11]Omer Berkman, Yossi Matias, Prabhakar Ragde:
Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains. J. Algorithms 28(2): 197-215 (1998) - 1996
- [j10]Omer Berkman, Baruch Schieber, Uzi Vishkin:
A fast parallel algorithm for finding the convex hull of a sorted point set. Int. J. Comput. Geom. Appl. 6(2): 231-242 (1996) - 1995
- [j9]Omer Berkman, Uzi Vishkin:
Almost Fully-parallel Parentheses Matching. Discret. Appl. Math. 57(1): 11-28 (1995) - [j8]Omer Berkman, Costas S. Iliopoulos, Kunsoo Park:
The Subtree Max Gap Problem with Application to Parallel String Covering. Inf. Comput. 123(1): 127-137 (1995) - [j7]Omer Berkman, Yossi Matias:
Fast Parallel Algorithms for Minimum and Related Problems with Small Integer Inputs. Parallel Process. Lett. 5: 223-230 (1995) - [c8]Omer Berkman, Yossi Matias:
Fast parallel algorithms for minimum and related problems with small integer inputs. IPPS 1995: 203-207 - [c7]Omer Berkman, Phillip B. Gibbons, Yossi Matias:
On the Power of Randomization for the Common PRAM. ISTCS 1995: 229-240 - 1994
- [j6]Omer Berkman, Uzi Vishkin:
Finding Level-Ancestors in Trees. J. Comput. Syst. Sci. 48(2): 214-230 (1994) - [j5]Omer Berkman, Joseph F. JáJá, Sridhar Krishnamurthy, Ramakrishna Thurimella, Uzi Vishkin:
Top-Bottom Routing Around a Rectangle is as Easy as Computing Prefix Minima. SIAM J. Comput. 23(3): 449-465 (1994) - [c6]Amir M. Ben-Amram, Omer Berkman, Costas S. Iliopoulos, Kunsoo Park:
The Subtree Max Gap Problem with Application to Parallel String Covering. SODA 1994: 501-510 - 1993
- [j4]Omer Berkman, Uzi Vishkin:
On Parallel Integer Merging. Inf. Comput. 106(2): 266-285 (1993) - [j3]Omer Berkman, Baruch Schieber, Uzi Vishkin:
Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values. J. Algorithms 14(3): 344-370 (1993) - [j2]Omer Berkman, Uzi Vishkin:
Recursive Star-Tree Parallel Data Structure. SIAM J. Comput. 22(2): 221-242 (1993) - [c5]Omer Berkman, Yossi Matias, Prabhakar Ragde:
Triply-Logarithmic Upper and Lower Bounds for Minimum, Range Minima, and Related Problems with Integer Inputs. WADS 1993: 175-187 - 1992
- [j1]Omer Berkman, Yossi Matias, Uzi Vishkin:
Randomized Range-Maxima in Nearly-Constant Parallel Time. Comput. Complex. 2: 350-373 (1992) - [c4]Omer Berkman, Yossi Matias, Uzi Vishkin:
Randomized Range-Maxima inNearly-Constant Parallel Time. ISAAC 1992: 135-144 - 1991
- [b1]Omer Berkman:
Paradigms for very fast parallel algorithms. Tel Aviv University, Israel, 1991 - 1990
- [c3]Omer Berkman, Joseph F. JáJá, Sridhar Krishnamurthy, Ramakrishna Thurimella, Uzi Vishkin:
Some Triply-Logarithmic Parallel Algorithms (Extended Abstract). FOCS 1990: 871-881
1980 – 1989
- 1989
- [c2]Omer Berkman, Uzi Vishkin:
Recursive *-Tree Parallel Data-Structure (Extended Abstract). FOCS 1989: 196-202 - [c1]Omer Berkman, Dany Breslauer, Zvi Galil, Baruch Schieber, Uzi Vishkin:
Highly Parallelizable Problems (Extended Abstract). STOC 1989: 309-319
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:23 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:
