Omer Berkman

Available identifiers

Publication	Date of Publication	Type
Triply-logarithmic upper and lower bounds for minimum, range minima, and related problems with integer inputs	2023-01-18	Paper
The subtree max gap problem with application to parallel string covering	2006-10-10	Paper
https://portal.mardi4nfdi.de/entity/Q5460884	2005-07-20	Paper
Element distinctness on one-tape Turing machines: a complete solution	2004-12-09	Paper
Efficient dynamic traitor tracing	2001-03-19	Paper
https://portal.mardi4nfdi.de/entity/Q4952673	2000-05-10	Paper
Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains	1998-11-24	Paper
https://portal.mardi4nfdi.de/entity/Q3128912	1997-04-23	Paper
A FAST PARALLEL ALGORITHM FOR FINDING THE CONVEX HULL OF A SORTED POINT SET	1996-08-12	Paper
Almost fully-parallel parentheses matching	1995-03-19	Paper
Top-Bottom Routing around a Rectangle is as Easy as Computing Prefix Minima	1994-08-14	Paper
Finding level-ancestors in trees	1994-06-29	Paper
On parallel integer merging	1993-12-20	Paper
Randomized range-maxima in nearly-constant parallel time	1993-09-16	Paper
Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values	1993-06-29	Paper
Recursive Star-Tree Parallel Data Structure	1993-05-17	Paper

This page was built for person: Omer Berkman