MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named "Haim Kaplan" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

78 documents found, showing 1 through 10. Next 10 →

ATOM

Seminar on Advanvced Topics in Data Structures
by Haim Kaplan — 2001
… Seminar on Advanced topics in data structures Fall 2001/2002 Haim Kaplan phone: 03…
Add To MetaCart

Persistent data structures
by Haim Kaplan — 1995 — IN HANDBOOK ON DATA STRUCTURES AND APPLICATIONS, CRC PRESS 2001, DINESH MEHTA AND SARTAJ SAHNI (EDITORS) BOROUJERDI, A., AND MORET, B.M.E., &QUOT;PERSISTENCY IN COMPUTATIONAL GEOMETRY,&QUOT; PROC. 7TH CANADIAN CONF. COMP. GEOMETRY, QUEBEC
…1 Persistent data structures Haim Kaplan Tel Aviv University 1.1 Introduction…
Cited by 1 (0 self) – Add To MetaCart

Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations
by Haim Kaplan, Elad Verbin
… Haim Kaplan and Elad Verbin ? School of Computer Science, Tel Aviv University, Tel Aviv, Israel…
Add To MetaCart

On-line Complexity of Monotone Set Systems (Extended Abstract)
by Haim Kaplan, Mario Szegedy — 1999 — In: Proceedings of the 10th annual ACM-SIAM symposium on Discrete algorithms, Society for Industrial and Applied Mathematics
…On-line Complexity of Monotone Set Systems (extended abstract) Haim Kaplan and Mario Szegedy AT…
Add To MetaCart

Exploiting regularities in Web traffic patterns for cache replacement
by Edith Cohen, Haim Kaplan — 1999 — Proceedings of 31st ACM STOC
…Exploiting Regularities in Web Trac Patterns for Cache Replacement Edith Cohen Haim Kaplan AT…
Cited by 15 (5 self) – Add To MetaCart

Caching Documents with Variable Sizes and Fetching Costs: An LP-Based Approach
by Edith Cohen, Haim Kaplan — 1999 — ACM/SIAM Symposium on Discrete Algorithms, S879--S880
…Caching Documents with Variable Sizes and Fetching Costs: An LP-Based Approach Edith Cohen Haim…
Cited by 2 (0 self) – Add To MetaCart

Bounded Degree Interval Sandwich Problems
by Haim Kaplan, Ron Shamir — 1999 — Algorithmica
…Bounded Degree Interval Sandwich Problems Haim Kaplan y Ron Shamir z Abstract The problems…
Cited by 4 (1 self) – Add To MetaCart

On-line Complexity of Monotone Set Systems
by Haim Kaplan, Mario Szegedy — 1998 — In: Proceedings of the 10th annual ACM-SIAM symposium on Discrete algorithms, Society for Industrial and Applied Mathematics
…On-line Complexity of Monotone Set Systems Preliminary copy: Please do not Distribute Haim Kaplan…
Cited by 4 (0 self) – Add To MetaCart

The Domatic Number Problem on Some Perfect Graph Families
by Haim Kaplan, Ron Shamir — 1995 — Information Processing Letters
…The Domatic Number Problem on Some Perfect Graph Families Haim Kaplan and Ron Shamir School…
Cited by 8 (0 self) – Add To MetaCart

Physical Maps and Interval Sandwich Problems: Bounded Degrees Help
by Haim Kaplan, Ron Shamir — 1996 — In Proc. ISTCS
…Physical Maps and Interval Sandwich Problems: Bounded Degrees Help Haim Kaplan Department…
Cited by 3 (2 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB