Udi Manber - RankMe

67 papers A* 13A 2B 9C 1Misc 1Journal 34Unranked 6

Year	Rank	Type	Title / Venue / Authors
2006	Misc	`conf`	Keynote. NSDI Udi Manber
2004	A*	`conf`	Customer-centric innovations for search and e-commerce. EC Udi Manber
2000	J	`jnl`	The business of personalization: experience with personalization of Yahoo! Commun. ACM Udi Manber, Ash Patel, John Robison
1999	A*	`conf`	Integrating Content-Based Access Mechanisms with Hierarchical File Systems. OSDI Burra Gopal, Udi Manber
1998	J	`jnl`	Connecting Diverse Web Search Facilities. IEEE Data Eng. Bull. Udi Manber, Peter A. Bigot
1998	—	`conf`	Deducing Similarities in Java Sources from Bytecodes. USENIX ATC Brenda S. Baker, Udi Manber
1998	A*	`conf`	How to Find It: Research Issues in Distributed Search (Abstract). PODC Udi Manber
1998	B	`conf`	How to Find It: Research Issues in Distributed Search (Abstract). SPAA Udi Manber
1997	J	`jnl`	A text Compression Scheme that Allows Fast Searching Directly in the Compressed File. ACM Trans. Inf. Syst. Udi Manber
1997	—	`conf`	Creating a Personal Web Notebook. USENIX Symposium on Internet Technologies and Systems Udi Manber
1997	—	`conf`	The Search Broker. USENIX Symposium on Internet Technologies and Systems Udi Manber, Peter A. Bigot
1997	C	`conf`	The use of customized emphasis in text visualization. IV Udi Manber
1996	J	`jnl`	A Subquadratic Algorithm for Approximate Limited Expression Matching. Algorithmica Sun Wu, Udi Manber, Eugene W. Myers
1996	J	`jnl`	A simple scheme to make passwords based on one-way functions much harder to crack. Comput. Secur. Udi Manber
1996	B	`conf`	Approximate Multiple Strings Search. CPM Robert Muth, Udi Manber
1996	A*	`conf`	Future Directions and Research Problems in the World Wide Web (Abstract). PODS Udi Manber
1995	J	`jnl`	A Subquadratic Algorithm for Approximate Regular Expression Matching. J. Algorithms Sun Wu, Udi Manber, Eugene W. Myers
1995	J	`jnl`	The Harvest Information Discovery and Access System. Comput. Networks ISDN Syst. C. Mic Bowman, Peter B. Danzig, Darren R. Hardy, Udi Manber, Michael F. Schwartz
1994	B	`conf`	A Text Compression Scheme That Allows Fast Searching Directly in the Compressed File. CPM Udi Manber
1994	J	`jnl`	An Algorithm for Approximate Membership checking with Application to Password Security. Inf. Process. Lett. Udi Manber, Sun Wu
1994	—	`conf`	Finding Similar Files in a Large File System. USENIX Winter Udi Manber
1994	—	`conf`	GLIMPSE: A Tool to Search Through Entire File Systems. USENIX Winter Udi Manber, Sun Wu
1994	B	`conf`	Proximity Matching Using Fixed-Queries Trees. CPM Ricardo A. Baeza-Yates, Walter Cunto, Udi Manber, Sun Wu
1994	J	`jnl`	Scalable Internet Discovery: Research Problems and Approaches. Commun. ACM C. Mic Bowman, Peter B. Danzig, Udi Manber, Michael F. Schwartz
1993	B	`ed.`	Combinatorial Pattern Matching, 4th Annual Symposium, CPM 93, Padova, Italy, June 2-4, 1993, Proceedings CPM Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber
1993	J	`jnl`	Suffix Arrays: A New Method for On-Line String Searches. SIAM J. Comput. Udi Manber, Eugene W. Myers
1992	J	`jnl`	An algorithm for min-cost edge-disjoint cycles and its applications. Oper. Res. Lett. Sun Wu, Udi Manber
1992	B	`ed.`	Combinatorial Pattern Matching, Third Annual Symposium, CPM 92, Tucson, Arizona, USA, April 29 - May 1, 1992, Proceedings CPM Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber
1992	J	`jnl`	Fast Text Searching Allowing Errors. Commun. ACM Sun Wu, Udi Manber
1992	J	`jnl`	Path-Matching Problems. Algorithmica Sun Wu, Udi Manber
1991	J	`jnl`	An Algorithm for String Matching with a Sequence of don't Cares. Inf. Process. Lett. Udi Manber, Ricardo A. Baeza-Yates
1991	—	`conf`	Flying Through Hypertext. Hypertext Patrick Lai, Udi Manber
1991	J	`jnl`	The Complexity of Controlled Selection Inf. Comput. Kirk Pruhs, Udi Manber
1990	J	`jnl`	An O(NP) Sequence Comparison Algorithm. Inf. Process. Lett. Sun Wu, Udi Manber, Gene Myers, Webb Miller
1990	J	`jnl`	Chain Reactions in Networks. Computer Udi Manber
1990	J	`jnl`	Recognizing Breadth-First Search Trees in Linear Time. Inf. Process. Lett. Udi Manber
1990	A*	`conf`	Suffix Arrays: A New Method for On-Line String Searches. SODA Udi Manber, Gene Myers
1989	—	`book`	Introduction to algorithms - a creative approach. Udi Manber
1989	A*	`conf`	The Complexity of Controlled Selection. ICALP Kirk Pruhs, Udi Manber
1988	A*	`conf`	Distributed Round-Robin and First-Come First-Serve Protocols and Their Application to Multiprocessor Bus Arbitration. ISCA Mary K. Vernon, Udi Manber
1988	J	`jnl`	Efficient storage of nonadaptive routing tables. Networks Udi Manber, Lawrence McVoy
1988	J	`jnl`	Two algorithms for barrier synchronization. Int. J. Parallel Program. Debra Hensgen, Raphael A. Finkel, Udi Manber
1988	J	`jnl`	Using Induction to Design Algorithms. Commun. ACM Udi Manber
1987	J	`jnl`	A Probabilistic Distributed Algorithm for Set Intersection and its Analysis. Theor. Comput. Sci. Thomas G. Kurtz, Udi Manber
1987	J	`jnl`	A Probabilistic Pipeline Algorithm for IEEE Trans. Computers Albert G. Greenberg, Udi Manber
1987	B	`conf`	Active Channels and Their Applications to Parallel Computing. ICPP Miron Livny, Udi Manber
1987	J	`jnl`	DIB - A Distributed Implementation of Backtracking. ACM Trans. Program. Lang. Syst. Raphael A. Finkel, Udi Manber
1987	A	`conf`	On Disseminating Information Reliably without Broadcasting. ICDCS Noga Alon, Amnon Barak, Udi Manber
1987	J	`jnl`	On non-intersecting Eulerian circuits. Discret. Appl. Math. Samuel W. Bent, Udi Manber
1986	J	`jnl`	On Maintaining Dynamic Information in a Concurrent Environment. SIAM J. Comput. Udi Manber
1985	A*	`conf`	A Probabilistic Distributed Algorithm for Set Intersection and Its Analysis (Preliminary Version). ICALP Thomas G. Kurtz, Udi Manber
1985	B	`conf`	A Probabilistic Pipeline Algorithm for K-Selection on the Tree Machine. ICPP Albert G. Greenberg, Udi Manber
1985	J	`jnl`	Applications of Ramsey's Theorem to Decision Tree Complexity J. ACM Shlomo Moran, Marc Snir, Udi Manber
1985	A	`conf`	DIB - A Distributed Implementation of Backtracking. ICDCS Raphael A. Finkel, Udi Manber
1985	J	`jnl`	Distributed Computation Via Active Messages. IEEE Trans. Computers Miron Livny, Udi Manber
1985	B	`conf`	Shift Arithmetic on a Token Ring Network. ICPP Miron Livny, Udi Manber
1985	J	`jnl`	The Complexity of Problems on Probabilistic Nondeterministic, and Alternating Decision Trees J. ACM Udi Manber, Martin Tompa
1984	J	`jnl`	A Probabilistic Lower Bound for Checking Disjointness of Sets. Inf. Process. Lett. Udi Manber
1984	A*	`conf`	Applications of Ramsey's Theorem to Decision Trees Complexity (Preliminary Version) FOCS Shlomo Moran, Marc Snir, Udi Manber
1984	J	`jnl`	Concurrency Control In a Dynamic Search Structure. ACM Trans. Database Syst. Udi Manber, Richard E. Ladner
1984	J	`jnl`	Concurrent Maintenance of Binary Search Trees. IEEE Trans. Software Eng. Udi Manber
1984	A*	`conf`	On Maintaining Dynamic Information in a Concurrent Environment (Preliminary Version) STOC Udi Manber
1984	J	`jnl`	The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem. SIAM J. Comput. Udi Manber, Martin Tompa
1982	A*	`conf`	Concurrency Control in a Dynamic Search Structure. PODS Udi Manber, Richard E. Ladner
1982	A*	`conf`	Probabilistic, Nondeterministic, and Alternating Decision Trees STOC Udi Manber, Martin Tompa
1981	A*	`conf`	The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem FOCS Udi Manber, Martin Tompa
1980	J	`jnl`	System Diagnosis with Repair. IEEE Trans. Computers Udi Manber