Udi Manber
According to our database^{1},
Udi Manber
authored at least 61 papers
between 1980 and 2006.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at zbmath.org

at id.loc.gov

at dl.acm.org
On csauthors.net:
Bibliography
2006
Keynote.
Proceedings of the 3rd Symposium on Networked Systems Design and Implementation (NSDI 2006), 2006
2004
Customercentric innovations for search and ecommerce.
Proceedings of the Proceedings 5th ACM Conference on Electronic Commerce (EC2004), 2004
2000
The business of personalization: experience with personalization of Yahoo!
Commun. ACM, 2000
1999
Integrating ContentBased Access Mechanisms with Hierarchical File Systems.
Proceedings of the Third USENIX Symposium on Operating Systems Design and Implementation (OSDI), 1999
1998
Connecting Diverse Web Search Facilities.
IEEE Data Eng. Bull., 1998
Deducing Similarities in Java Sources from Bytecodes.
Proceedings of the 1998 USENIX Annual Technical Conference, 1998
How to Find It: Research Issues in Distributed Search (Abstract).
Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, 1998
How to Find It: Research Issues in Distributed Search (Abstract).
Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998
1997
The Search Broker.
Proceedings of the 1st USENIX Symposium on Internet Technologies and Systems, 1997
Creating a Personal Web Notebook.
Proceedings of the 1st USENIX Symposium on Internet Technologies and Systems, 1997
The use of customized emphasis in text visualization.
Proceedings of the First International Conference on Information Visualisation, 1997
1996
A simple scheme to make passwords based on oneway functions much harder to crack.
Computers & Security, 1996
A Subquadratic Algorithm for Approximate Limited Expression Matching.
Algorithmica, 1996
Future Directions and Research Problems in the World Wide Web (Abstract).
Proceedings of the Fifteenth ACM SIGACTSIGMODSIGART Symposium on Principles of Database Systems, 1996
Approximate Multiple Strings Search.
Proceedings of the Combinatorial Pattern Matching, 7th Annual Symposium, 1996
1995
A Subquadratic Algorithm for Approximate Regular Expression Matching.
J. Algorithms, 1995
The Harvest Information Discovery and Access System.
Computer Networks and ISDN Systems, 1995
1994
An Algorithm for Approximate Membership checking with Application to Password Security.
Inf. Process. Lett., 1994
Scalable Internet Discovery: Research Problems and Approaches.
Commun. ACM, 1994
GLIMPSE: A Tool to Search Through Entire File Systems.
Proceedings of the USENIX Winter 1994 Technical Conference, 1994
Finding Similar Files in a Large File System.
Proceedings of the USENIX Winter 1994 Technical Conference, 1994
A Text Compression Scheme That Allows Fast Searching Directly in the Compressed File.
Proceedings of the Combinatorial Pattern Matching, 5th Annual Symposium, 1994
Proximity Matching Using FixedQueries Trees.
Proceedings of the Combinatorial Pattern Matching, 5th Annual Symposium, 1994
1992
An algorithm for mincost edgedisjoint cycles and its applications.
Oper. Res. Lett., 1992
Fast Text Searching Allowing Errors.
Commun. ACM, 1992
PathMatching Problems.
Algorithmica, 1992
1991
The Complexity of Controlled Selection
Inf. Comput., March, 1991
An Algorithm for String Matching with a Sequence of don't Cares.
Inf. Process. Lett., 1991
Flying Through Hypertext.
Proceedings of the Hypertext'91 Proceedings, San Antonio, Texas, USA, 1991
1990
An O(NP) Sequence Comparison Algorithm.
Inf. Process. Lett., 1990
Recognizing BreadthFirst Search Trees in Linear Time.
Inf. Process. Lett., 1990
Chain Reactions in Networks.
IEEE Computer, 1990
Suffix Arrays: A New Method for OnLine String Searches.
Proceedings of the First Annual ACMSIAM Symposium on Discrete Algorithms, 1990
1989
The Complexity of Controlled Selection.
Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989
Introduction to algorithms  a creative approach.
AddisonWesley, ISBN: 9780201120370, 1989
1988
Efficient storage of nonadaptive routing tables.
Networks, 1988
Two algorithms for barrier synchronization.
International Journal of Parallel Programming, 1988
Using Induction to Design Algorithms.
Commun. ACM, 1988
Distributed RoundRobin and FirstCome FirstServe Protocols and Their Application to Multiprocessor Bus Arbitration.
Proceedings of the 15th Annual International Symposium on Computer Architecture, 1988
1987
A Probabilistic Distributed Algorithm for Set Intersection and its Analysis.
Theor. Comput. Sci., 1987
A Probabilistic Pipeline Algorithm for K Selection on the Tree Machine.
IEEE Trans. Computers, 1987
On nonintersecting Eulerian circuits.
Discrete Applied Mathematics, 1987
Active Channels and Their Applications to Parallel Computing.
Proceedings of the International Conference on Parallel Processing, 1987
On Disseminating Information Reliably without Broadcasting.
Proceedings of the 7th International Conference on Distributed Computing Systems, 1987
1986
On Maintaining Dynamic Information in a Concurrent Environment.
SIAM J. Comput., 1986
1985
Applications of Ramsey's Theorem to Decision Tree Complexity
J. ACM, October, 1985
The Complexity of Problems on Probabilistic Nondeterministic, and Alternating Decision Trees
J. ACM, July, 1985
Distributed Computation Via Active Messages.
IEEE Trans. Computers, 1985
Shift Arithmetic on a Token Ring Network.
Proceedings of the International Conference on Parallel Processing, 1985
A Probabilistic Pipeline Algorithm for KSelection on the Tree Machine.
Proceedings of the International Conference on Parallel Processing, 1985
DIB  A Distributed Implementation of Backtracking.
Proceedings of the 5th International Conference on Distributed Computing Systems, 1985
A Probabilistic Distributed Algorithm for Set Intersection and Its Analysis (Preliminary Version).
Proceedings of the Automata, 1985
1984
Concurrent Maintenance of Binary Search Trees.
IEEE Trans. Software Eng., 1984
The Effect of Number of Hamiltonian Paths on the Complexity of a VertexColoring Problem.
SIAM J. Comput., 1984
A Probabilistic Lower Bound for Checking Disjointness of Sets.
Inf. Process. Lett., 1984
On Maintaining Dynamic Information in a Concurrent Environment (Preliminary Version)
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)
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984
1982
Probabilistic, Nondeterministic, and Alternating Decision Trees
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982
Concurrency Control in a Dynamic Search Structure.
Proceedings of the ACM Symposium on Principles of Database Systems, 1982
1981
The Effect of Number of Hamiltonian Paths on the Complexity of a VertexColoring Problem
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981
1980
System Diagnosis with Repair.
IEEE Trans. Computers, 1980