Search for Author All Reviews
	Kaplan, Haim     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 5 of 5 reviews       Processing top-k queries from samples Cohen E., Grossaug N., Kaplan H. Computer Networks 52(14): 2605-2622, 2008.  Type: Article Each year, search engines such as Google and Yahoo! publish the year-end top ten queries. Since Google and Yahoo! can collect and analyze all the search terms, the top ten queries must be very accurate. However, for other situations wh...... Feb 12 2009     The greedy algorithm for shortest superstrings Kaplan H., Shafrir N. Information Processing Letters 93(1): 13-17, 2005.  Type: Article The shortest superstring problem is as follows: given a finite set of strings, find the shortest possible string s, such that every string in the set is a substring of s. Although this question is ...... Nov 3 2005     Performance aspects of distributed caches using, TTL-based consistency Cohen E., Halperin E., Kaplan H. Theoretical Computer Science 331(1): 73-96, 2005.  Type: Article This paper analyzes three time to live (TTL)-based cache policies adopted in Web services. Specifically, authoritative, exclusive, and independent sources are defined. The authoritative source can provide a copy of the requested object...... Sep 14 2005     Making data structures confluently persistent Fiat A., Kaplan H. Journal of Algorithms 48(1): 16-58, 2003.  Type: Article This paper presents a general technique to transform any pointer-based data structure into one that is “confluently persistent,” thus answering a longstanding open problem posed by Driscoll, Sarnak, Sleator, and Tar...... Aug 5 2004     Purely functional, real-time deques with catenation Kaplan H., Tarjan R. Journal of the ACM 46(5): 577-603, 1999.  Type: Article A real-time, purely functional implementation of deques with catenation is presented. The authors demonstrate that their data structure is both more efficient and simpler than previously proposed structures. They note that, in addition...... May 1 2000
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy