Остановите войну!
for scientists:
default search action
Omer Berkman
- > Home > Persons > Omer Berkman
Publications
- 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) - 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) - 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) - 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 - 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 - 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
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 2023-11-04 22:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint