| 2006 |
|---|
| 60 | | Udi Manber:
Keynote.
NSDI 2006 |
| 2004 |
|---|
| 59 | EE | Udi Manber:
Customer-centric innovations for search and e-commerce.
ACM Conference on Electronic Commerce 2004: 199 |
| 2000 |
|---|
| 58 | EE | Udi Manber,
Ash Patel,
John Robison:
The business of personalization: experience with personalization of Yahoo!
Commun. ACM 43(8): 35-39 (2000) |
| 1999 |
|---|
| 57 | EE | Burra Gopal,
Udi Manber:
Integrating Content-Based Access Mechanisms with Hierarchical File Systems.
OSDI 1999: 265-278 |
| 1998 |
|---|
| 56 | EE | Udi Manber:
How to Find It: Research Issues in Distributed Search (Abstract).
PODC 1998: 6 |
| 55 | EE | Udi Manber:
How to Find It: Research Issues in Distributed Search (Abstract).
SPAA 1998: 4 |
| 54 | EE | Udi Manber,
Peter A. Bigot:
Connecting Diverse Web Search Facilities.
IEEE Data Eng. Bull. 21(2): 21-27 (1998) |
| 1997 |
|---|
| 53 | EE | Udi Manber:
Creating a Personal Web Notebook.
USENIX Symposium on Internet Technologies and Systems 1997 |
| 52 | EE | Udi Manber,
Peter A. Bigot:
The Search Broker.
USENIX Symposium on Internet Technologies and Systems 1997 |
| 51 | EE | Udi Manber:
A text Compression Scheme that Allows Fast Searching Directly in the Compressed File.
ACM Trans. Inf. Syst. 15(2): 124-136 (1997) |
| 1996 |
|---|
| 50 | | Robert Muth,
Udi Manber:
Approximate Multiple Strings Search.
CPM 1996: 75-86 |
| 49 | EE | Udi Manber:
Future Directions and Research Problems in the World Wide Web (Abstract).
PODS 1996: 213-215 |
| 48 | | Sun Wu,
Udi Manber,
Eugene W. Myers:
A Subquadratic Algorithm for Approximate Limited Expression Matching.
Algorithmica 15(1): 50-67 (1996) |
| 47 | EE | Udi Manber:
A simple scheme to make passwords based on one-way functions much harder to crack.
Computers & Security 15(2): 171-176 (1996) |
| 1995 |
|---|
| 46 | EE | C. Mic Bowman,
Peter B. Danzig,
Darren R. Hardy,
Udi Manber,
Michael F. Schwartz:
The Harvest Information Discovery and Access System.
Computer Networks and ISDN Systems 28(1&2): 119-125 (1995) |
| 45 | | Sun Wu,
Udi Manber,
Eugene W. Myers:
A Subquadratic Algorithm for Approximate Regular Expression Matching.
J. Algorithms 19(3): 346-360 (1995) |
| 1994 |
|---|
| 44 | | Udi Manber:
A Text Compression Scheme That Allows Fast Searching Directly in the Compressed File.
CPM 1994: 113-124 |
| 43 | | Ricardo A. Baeza-Yates,
Walter Cunto,
Udi Manber,
Sun Wu:
Proximity Matching Using Fixed-Queries Trees.
CPM 1994: 198-212 |
| 42 | | Udi Manber:
Finding Similar Files in a Large File System.
USENIX Winter 1994: 1-10 |
| 41 | | Udi Manber,
Sun Wu:
GLIMPSE: A Tool to Search Through Entire File Systems.
USENIX Winter 1994: 23-32 |
| 40 | | C. Mic Bowman,
Peter B. Danzig,
Udi Manber,
Michael F. Schwartz:
Scalable Internet Discovery: Research Problems and Approaches.
Commun. ACM 37(8): 98-107 (1994) |
| 39 | | Udi Manber,
Sun Wu:
An Algorithm for Approximate Membership checking with Application to Password Security.
Inf. Process. Lett. 50(4): 191-197 (1994) |
| 1993 |
|---|
| 38 | | Alberto Apostolico,
Maxime Crochemore,
Zvi Galil,
Udi Manber:
Combinatorial Pattern Matching, 4th Annual Symposium, CPM 93, Padova, Italy, June 2-4, 1993, Proceedings
Springer 1993 |
| 37 | | Udi Manber,
Eugene W. Myers:
Suffix Arrays: A New Method for On-Line String Searches.
SIAM J. Comput. 22(5): 935-948 (1993) |
| 1992 |
|---|
| 36 | | Alberto Apostolico,
Maxime Crochemore,
Zvi Galil,
Udi Manber:
Combinatorial Pattern Matching, Third Annual Symposium, CPM 92, Tucson, Arizona, USA, April 29 - May 1, 1992, Proceedings
Springer 1992 |
| 35 | | Sun Wu,
Udi Manber:
Path-Matching Problems.
Algorithmica 8(2): 89-101 (1992) |
| 34 | | Sun Wu,
Udi Manber:
Fast Text Searching Allowing Errors.
Commun. ACM 35(10): 83-91 (1992) |
| 1991 |
|---|
| 33 | EE | Patrick Lai,
Udi Manber:
Flying Through Hypertext.
Hypertext 1991: 123-132 |
| 32 | | Kirk Pruhs,
Udi Manber:
The Complexity of Controlled Selection
Inf. Comput. 91(1): 103-127 (1991) |
| 31 | | Udi Manber,
Ricardo A. Baeza-Yates:
An Algorithm for String Matching with a Sequence of don't Cares.
Inf. Process. Lett. 37(3): 133-136 (1991) |
| 1990 |
|---|
| 30 | | Udi Manber,
Gene Myers:
Suffix Arrays: A New Method for On-Line String Searches.
SODA 1990: 319-327 |
| 29 | | Udi Manber:
Chain Reactions in Networks.
IEEE Computer 23(10): 57-63 (1990) |
| 28 | | Udi Manber:
Recognizing Breadth-First Search Trees in Linear Time.
Inf. Process. Lett. 34(4): 167-171 (1990) |
| 27 | | Sun Wu,
Udi Manber,
Gene Myers,
Webb Miller:
An O(NP) Sequence Comparison Algorithm.
Inf. Process. Lett. 35(6): 317-323 (1990) |
| 1989 |
|---|
| 26 | | Kirk Pruhs,
Udi Manber:
The Complexity of Controlled Selection.
ICALP 1989: 672-686 |
| 1988 |
|---|
| 25 | | Mary K. Vernon,
Udi Manber:
Distributed Round-Robin and First-Come First-Serve Protocols and Their Application to Multiprocessor Bus Arbitration.
ISCA 1988: 269-277 |
| 24 | | Udi Manber:
Using Induction to Design Algorithms.
Commun. ACM 31(11): 1300-1313 (1988) |
| 1987 |
|---|
| 23 | | Noga Alon,
Amnon Barak,
Udi Manber:
On Disseminating Information Reliably without Broadcasting.
ICDCS 1987: 74-81 |
| 22 | | Miron Livny,
Udi Manber:
Active Channels and Their Applications to Parallel Computing.
ICPP 1987: 367-369 |
| 21 | EE | Raphael A. Finkel,
Udi Manber:
DIB - A Distributed Implementation of Backtracking.
ACM Trans. Program. Lang. Syst. 9(2): 235-256 (1987) |
| 20 | | Albert G. Greenberg,
Udi Manber:
A Probabilistic Pipeline Algorithm for K Selection on the Tree Machine.
IEEE Trans. Computers 36(3): 359-362 (1987) |
| 19 | | Thomas G. Kurtz,
Udi Manber:
A Probabilistic Distributed Algorithm for Set Intersection and its Analysis.
Theor. Comput. Sci. 49: 267-282 (1987) |
| 1986 |
|---|
| 18 | | Udi Manber:
On Maintaining Dynamic Information in a Concurrent Environment.
SIAM J. Comput. 15(4): 1130-1142 (1986) |
| 1985 |
|---|
| 17 | | Thomas G. Kurtz,
Udi Manber:
A Probabilistic Distributed Algorithm for Set Intersection and Its Analysis (Preliminary Version).
ICALP 1985: 356-362 |
| 16 | | Raphael A. Finkel,
Udi Manber:
DIB - A Distributed Implementation of Backtracking.
ICDCS 1985: 446-452 |
| 15 | | Albert G. Greenberg,
Udi Manber:
A Probabilistic Pipeline Algorithm for K-Selection on the Tree Machine.
ICPP 1985: 1-5 |
| 14 | | Miron Livny,
Udi Manber:
Shift Arithmetic on a Token Ring Network.
ICPP 1985: 301-304 |
| 13 | | Miron Livny,
Udi Manber:
Distributed Computation Via Active Messages.
IEEE Trans. Computers 34(12): 1185-1190 (1985) |
| 12 | EE | Udi Manber,
Martin Tompa:
The Complexity of Problems on Probabilistic Nondeterministic, and Alternating Decision Trees
J. ACM 32(3): 720-732 (1985) |
| 11 | EE | Shlomo Moran,
Marc Snir,
Udi Manber:
Applications of Ramsey's Theorem to Decision Tree Complexity
J. ACM 32(4): 938-949 (1985) |
| 1984 |
|---|
| 10 | | Shlomo Moran,
Marc Snir,
Udi Manber:
Applications of Ramsey's Theorem to Decision Trees Complexity (Preliminary Version)
FOCS 1984: 332-337 |
| 9 | | Udi Manber:
On Maintaining Dynamic Information in a Concurrent Environment (Preliminary Version)
STOC 1984: 273-278 |
| 8 | EE | Udi Manber,
Richard E. Ladner:
Concurrency Control In a Dynamic Search Structure.
ACM Trans. Database Syst. 9(3): 439-455 (1984) |
| 7 | | Udi Manber:
Concurrent Maintenance of Binary Search Trees.
IEEE Trans. Software Eng. 10(6): 777-784 (1984) |
| 6 | | Udi Manber:
A Probabilistic Lower Bound for Checking Disjointness of Sets.
Inf. Process. Lett. 19(1): 51-53 (1984) |
| 5 | | Udi Manber,
Martin Tompa:
The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem.
SIAM J. Comput. 13(1): 109-115 (1984) |
| 1982 |
|---|
| 4 | EE | Udi Manber,
Richard E. Ladner:
Concurrency Control in a Dynamic Search Structure.
PODS 1982: 268-282 |
| 3 | | Udi Manber,
Martin Tompa:
Probabilistic, Nondeterministic, and Alternating Decision Trees
STOC 1982: 234-244 |
| 1981 |
|---|
| 2 | | Udi Manber,
Martin Tompa:
The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem
FOCS 1981: 220-227 |
| 1980 |
|---|
| 1 | | Udi Manber:
System Diagnosis with Repair.
IEEE Trans. Computers 29(10): 934-937 (1980) |
