Udi Manber

According to our database, Udi Manber authored at least 58 papers between 1980 and 2006.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2006

Keynote.

Udi Manber

Proceedings of the 3rd Symposium on Networked Systems Design and Implementation (NSDI 2006), 2006

2004

Customer-centric innovations for search and e-commerce.

Udi Manber

Proceedings of the Proceedings 5th ACM Conference on Electronic Commerce (EC-2004), 2004

2000

The business of personalization: experience with personalization of Yahoo!

Udi Manber, Ash Patel, John Robison

Commun. ACM, 2000

1999

Integrating Content-Based Access Mechanisms with Hierarchical File Systems.

Burra Gopal, Udi Manber

Proceedings of the Third USENIX Symposium on Operating Systems Design and Implementation (OSDI), 1999

1998

Connecting Diverse Web Search Facilities.

Udi Manber, Peter A. Bigot

IEEE Data Eng. Bull., 1998

Deducing Similarities in Java Sources from Bytecodes.

Brenda S. Baker, Udi Manber

Proceedings of the 1998 USENIX Annual Technical Conference, 1998

How to Find It: Research Issues in Distributed Search (Abstract).

Udi Manber

Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

1997

A text Compression Scheme that Allows Fast Searching Directly in the Compressed File.

Udi Manber

ACM Trans. Inf. Syst., 1997

The Search Broker.

Udi Manber, Peter A. Bigot

Proceedings of the 1st USENIX Symposium on Internet Technologies and Systems, 1997

Creating a Personal Web Notebook.

Udi Manber

Proceedings of the 1st USENIX Symposium on Internet Technologies and Systems, 1997

The use of customized emphasis in text visualization.

Udi Manber

Proceedings of the First International Conference on Information Visualisation, 1997

1996

A simple scheme to make passwords based on one-way functions much harder to crack.

Udi Manber

Comput. Secur., 1996

A Subquadratic Algorithm for Approximate Limited Expression Matching.

Sun Wu, Udi Manber, Eugene W. Myers

Algorithmica, 1996

Future Directions and Research Problems in the World Wide Web (Abstract).

Udi Manber

Proceedings of the Fifteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1996

Approximate Multiple Strings Search.

Robert Muth, Udi Manber

Proceedings of the Combinatorial Pattern Matching, 7th Annual Symposium, 1996

1995

A Subquadratic Algorithm for Approximate Regular Expression Matching.

Sun Wu, Udi Manber, Eugene W. Myers

J. Algorithms, 1995

The Harvest Information Discovery and Access System.

C. Mic Bowman, Peter B. Danzig, Darren R. Hardy, Udi Manber, Michael F. Schwartz

Comput. Networks ISDN Syst., 1995

1994

An Algorithm for Approximate Membership checking with Application to Password Security.

Udi Manber, Sun Wu

Inf. Process. Lett., 1994

Scalable Internet Discovery: Research Problems and Approaches.

C. Mic Bowman, Peter B. Danzig, Udi Manber, Michael F. Schwartz

Commun. ACM, 1994

GLIMPSE: A Tool to Search Through Entire File Systems.

Udi Manber, Sun Wu

Proceedings of the USENIX Winter 1994 Technical Conference, 1994

Finding Similar Files in a Large File System.

Udi Manber

Proceedings of the USENIX Winter 1994 Technical Conference, 1994

Proximity Matching Using Fixed-Queries Trees.

Ricardo A. Baeza-Yates, Walter Cunto, Udi Manber, Sun Wu

Proceedings of the Combinatorial Pattern Matching, 5th Annual Symposium, 1994

1993

Suffix Arrays: A New Method for On-Line String Searches.

Udi Manber, Eugene W. Myers

SIAM J. Comput., 1993

1992

An algorithm for min-cost edge-disjoint cycles and its applications.

Sun Wu, Udi Manber

Oper. Res. Lett., 1992

Fast Text Searching Allowing Errors.

Sun Wu, Udi Manber

Commun. ACM, 1992

Path-Matching Problems.

Sun Wu, Udi Manber

Algorithmica, 1992

1991

The Complexity of Controlled Selection

Kirk Pruhs, Udi Manber

Inf. Comput., March, 1991

An Algorithm for String Matching with a Sequence of don't Cares.

Udi Manber, Ricardo A. Baeza-Yates

Inf. Process. Lett., 1991

Flying Through Hypertext.

Patrick Lai, Udi Manber

Proceedings of the Hypertext'91 Proceedings, San Antonio, Texas, USA, 1991

1990

An O(NP) Sequence Comparison Algorithm.

Sun Wu, Udi Manber, Gene Myers, Webb Miller

Inf. Process. Lett., 1990

Recognizing Breadth-First Search Trees in Linear Time.

Udi Manber

Inf. Process. Lett., 1990

Chain Reactions in Networks.

Udi Manber

Computer, 1990

1989

Introduction to algorithms - a creative approach.

Udi Manber

Addison-Wesley, ISBN: 978-0-201-12037-0, 1989

1988

Efficient storage of nonadaptive routing tables.

Udi Manber, Lawrence McVoy

Networks, 1988

Two algorithms for barrier synchronization.

Debra Hensgen, Raphael A. Finkel, Udi Manber

Int. J. Parallel Program., 1988

Using Induction to Design Algorithms.

Udi Manber

Commun. ACM, 1988

Distributed Round-Robin and First-Come First-Serve Protocols and Their Application to Multiprocessor Bus Arbitration.

Mary K. Vernon, Udi Manber

Proceedings of the 15th Annual International Symposium on Computer Architecture, 1988

1987

DIB - A Distributed Implementation of Backtracking.

Raphael A. Finkel, Udi Manber

ACM Trans. Program. Lang. Syst., 1987

A Probabilistic Distributed Algorithm for Set Intersection and its Analysis.

Thomas G. Kurtz, Udi Manber

Theor. Comput. Sci., 1987

A Probabilistic Pipeline Algorithm for <i>K</i> Selection on the Tree Machine.

Albert G. Greenberg, Udi Manber

IEEE Trans. Computers, 1987

On non-intersecting Eulerian circuits.

Samuel W. Bent, Udi Manber

Discret. Appl. Math., 1987

Active Channels and Their Applications to Parallel Computing.

Miron Livny, Udi Manber

Proceedings of the International Conference on Parallel Processing, 1987

On Disseminating Information Reliably without Broadcasting.

Noga Alon, Amnon Barak, Udi Manber

Proceedings of the 7th International Conference on Distributed Computing Systems, 1987

1986

On Maintaining Dynamic Information in a Concurrent Environment.

Udi Manber

SIAM J. Comput., 1986

1985

Applications of Ramsey's Theorem to Decision Tree Complexity

Shlomo Moran, Marc Snir, Udi Manber

J. ACM, October, 1985

The Complexity of Problems on Probabilistic Nondeterministic, and Alternating Decision Trees

Udi Manber, Martin Tompa

J. ACM, July, 1985

Distributed Computation Via Active Messages.

Miron Livny, Udi Manber

IEEE Trans. Computers, 1985

Shift Arithmetic on a Token Ring Network.

Miron Livny, Udi Manber

Proceedings of the International Conference on Parallel Processing, 1985

A Probabilistic Pipeline Algorithm for K-Selection on the Tree Machine.

Albert G. Greenberg, Udi Manber

Proceedings of the International Conference on Parallel Processing, 1985

A Probabilistic Distributed Algorithm for Set Intersection and Its Analysis (Preliminary Version).

Thomas G. Kurtz, Udi Manber

Proceedings of the Automata, 1985

1984

Concurrent Maintenance of Binary Search Trees.

Udi Manber

IEEE Trans. Software Eng., 1984

Concurrency Control In a Dynamic Search Structure.

Udi Manber, Richard E. Ladner

ACM Trans. Database Syst., 1984

The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem.

Udi Manber, Martin Tompa

SIAM J. Comput., 1984

A Probabilistic Lower Bound for Checking Disjointness of Sets.

Udi Manber

Inf. Process. Lett., 1984

On Maintaining Dynamic Information in a Concurrent Environment (Preliminary Version)

Udi Manber

Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

Applications of Ramsey's Theorem to Decision Trees Complexity (Preliminary Version)

Shlomo Moran, Marc Snir, Udi Manber

Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

1982

Probabilistic, Nondeterministic, and Alternating Decision Trees

Udi Manber, Martin Tompa

Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982

1980

System Diagnosis with Repair.

Udi Manber

IEEE Trans. Computers, 1980