default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUdi Manber
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
[c30]Udi Manber:
Keynote. NSDI 2006- 2004
- [c29]Udi Manber:
Customer-centric innovations for search and e-commerce. EC 2004: 199 - 2000
- [j34]Udi Manber, Ash Patel, John Robison:
The business of personalization: experience with personalization of Yahoo! Commun. ACM 43(8): 35-39 (2000)
1990 – 1999
- 1999
- [c28]Burra Gopal, Udi Manber:
Integrating Content-Based Access Mechanisms with Hierarchical File Systems. OSDI 1999: 265-278 - 1998
- [j33]Udi Manber, Peter A. Bigot:
Connecting Diverse Web Search Facilities. IEEE Data Eng. Bull. 21(2): 21-27 (1998) - [c27]Udi Manber:
How to Find It: Research Issues in Distributed Search (Abstract). PODC 1998: 6 - [c26]Udi Manber:
How to Find It: Research Issues in Distributed Search (Abstract). SPAA 1998: 4 - [c25]Brenda S. Baker, Udi Manber:
Deducing Similarities in Java Sources from Bytecodes. USENIX ATC 1998 - 1997
- [j32]Udi Manber:
A text Compression Scheme that Allows Fast Searching Directly in the Compressed File. ACM Trans. Inf. Syst. 15(2): 124-136 (1997) - [c24]Udi Manber:
The use of customized emphasis in text visualization. IV 1997: 132-138 - [c23]Udi Manber:
Creating a Personal Web Notebook. USENIX Symposium on Internet Technologies and Systems 1997 - [c22]Udi Manber, Peter A. Bigot:
The Search Broker. USENIX Symposium on Internet Technologies and Systems 1997 - 1996
- [j31]Sun Wu, Udi Manber, Eugene W. Myers:
A Subquadratic Algorithm for Approximate Limited Expression Matching. Algorithmica 15(1): 50-67 (1996) - [j30]Udi Manber:
A simple scheme to make passwords based on one-way functions much harder to crack. Comput. Secur. 15(2): 171-176 (1996) - [c21]Robert Muth, Udi Manber:
Approximate Multiple Strings Search. CPM 1996: 75-86 - [c20]Udi Manber:
Future Directions and Research Problems in the World Wide Web (Abstract). PODS 1996: 213-215 - 1995
- [j29]C. Mic Bowman, Peter B. Danzig, Darren R. Hardy, Udi Manber, Michael F. Schwartz:
The Harvest Information Discovery and Access System. Comput. Networks ISDN Syst. 28(1&2): 119-125 (1995) - [j28]Sun Wu, Udi Manber, Eugene W. Myers:
A Subquadratic Algorithm for Approximate Regular Expression Matching. J. Algorithms 19(3): 346-360 (1995) - 1994
- [j27]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) - [j26]Udi Manber, Sun Wu:
An Algorithm for Approximate Membership checking with Application to Password Security. Inf. Process. Lett. 50(4): 191-197 (1994) - [c19]Udi Manber:
A Text Compression Scheme That Allows Fast Searching Directly in the Compressed File. CPM 1994: 113-124 - [c18]Ricardo A. Baeza-Yates, Walter Cunto, Udi Manber, Sun Wu:
Proximity Matching Using Fixed-Queries Trees. CPM 1994: 198-212 - [c17]Udi Manber:
Finding Similar Files in a Large File System. USENIX Winter 1994: 1-10 - [c16]Udi Manber, Sun Wu:
GLIMPSE: A Tool to Search Through Entire File Systems. USENIX Winter 1994: 23-32 - 1993
- [j25]Udi Manber, Eugene W. Myers:
Suffix Arrays: A New Method for On-Line String Searches. SIAM J. Comput. 22(5): 935-948 (1993) - [e2]Alberto Apostolico, Maxime Crochemore, Zvi Galil, Udi Manber:
Combinatorial Pattern Matching, 4th Annual Symposium, CPM 93, Padova, Italy, June 2-4, 1993, Proceedings. Lecture Notes in Computer Science 684, Springer 1993, ISBN 3-540-56764-X [contents] - 1992
- [j24]Sun Wu, Udi Manber:
Path-Matching Problems. Algorithmica 8(2): 89-101 (1992) - [j23]Sun Wu, Udi Manber:
Fast Text Searching Allowing Errors. Commun. ACM 35(10): 83-91 (1992) - [j22]Sun Wu, Udi Manber:
An algorithm for min-cost edge-disjoint cycles and its applications. Oper. Res. Lett. 12(3): 173-178 (1992) - [e1]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. Lecture Notes in Computer Science 644, Springer 1992, ISBN 3-540-56024-6 [contents] - 1991
- [j21]Kirk Pruhs, Udi Manber:
The Complexity of Controlled Selection. Inf. Comput. 91(1): 103-127 (1991) - [j20]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) - [c15]Patrick Lai, Udi Manber:
Flying Through Hypertext. Hypertext 1991: 123-132 - 1990
- [j19]Udi Manber:
Chain Reactions in Networks. Computer 23(10): 57-63 (1990) - [j18]Udi Manber:
Recognizing Breadth-First Search Trees in Linear Time. Inf. Process. Lett. 34(4): 167-171 (1990) - [j17]Sun Wu, Udi Manber, Gene Myers, Webb Miller:
An O(NP) Sequence Comparison Algorithm. Inf. Process. Lett. 35(6): 317-323 (1990) - [c14]Udi Manber, Gene Myers:
Suffix Arrays: A New Method for On-Line String Searches. SODA 1990: 319-327
1980 – 1989
- 1989
- [b1]Udi Manber:
Introduction to algorithms - a creative approach. Addison-Wesley 1989, ISBN 978-0-201-12037-0, pp. I-XIV, 1-478 - [c13]Kirk Pruhs, Udi Manber:
The Complexity of Controlled Selection. ICALP 1989: 672-686 - 1988
- [j16]Udi Manber:
Using Induction to Design Algorithms. Commun. ACM 31(11): 1300-1313 (1988) - [j15]Debra Hensgen, Raphael A. Finkel, Udi Manber:
Two algorithms for barrier synchronization. Int. J. Parallel Program. 17(1): 1-17 (1988) - [j14]Udi Manber, Lawrence McVoy:
Efficient storage of nonadaptive routing tables. Networks 18(4): 263-272 (1988) - [c12]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 - 1987
- [j13]Samuel W. Bent, Udi Manber:
On non-intersecting Eulerian circuits. Discret. Appl. Math. 18(1): 87-94 (1987) - [j12]Albert G. Greenberg, Udi Manber:
A Probabilistic Pipeline Algorithm for K Selection on the Tree Machine. IEEE Trans. Computers 36(3): 359-362 (1987) - [j11]Thomas G. Kurtz, Udi Manber:
A Probabilistic Distributed Algorithm for Set Intersection and its Analysis. Theor. Comput. Sci. 49: 267-282 (1987) - [j10]Raphael A. Finkel, Udi Manber:
DIB - A Distributed Implementation of Backtracking. ACM Trans. Program. Lang. Syst. 9(2): 235-256 (1987) - [c11]Noga Alon, Amnon Barak, Udi Manber:
On Disseminating Information Reliably without Broadcasting. ICDCS 1987: 74-81 - [c10]Miron Livny, Udi Manber:
Active Channels and Their Applications to Parallel Computing. ICPP 1987: 367-369 - 1986
- [j9]Udi Manber:
On Maintaining Dynamic Information in a Concurrent Environment. SIAM J. Comput. 15(4): 1130-1142 (1986) - 1985
- [j8]Udi Manber, Martin Tompa:
The Complexity of Problems on Probabilistic Nondeterministic, and Alternating Decision Trees. J. ACM 32(3): 720-732 (1985) - [j7]Shlomo Moran, Marc Snir, Udi Manber:
Applications of Ramsey's Theorem to Decision Tree Complexity. J. ACM 32(4): 938-949 (1985) - [j6]Miron Livny, Udi Manber:
Distributed Computation Via Active Messages. IEEE Trans. Computers 34(12): 1185-1190 (1985) - [c9]Thomas G. Kurtz, Udi Manber:
A Probabilistic Distributed Algorithm for Set Intersection and Its Analysis (Preliminary Version). ICALP 1985: 356-362 - [c8]Raphael A. Finkel, Udi Manber:
DIB - A Distributed Implementation of Backtracking. ICDCS 1985: 446-452 - [c7]Albert G. Greenberg, Udi Manber:
A Probabilistic Pipeline Algorithm for K-Selection on the Tree Machine. ICPP 1985: 1-5 - [c6]Miron Livny, Udi Manber:
Shift Arithmetic on a Token Ring Network. ICPP 1985: 301-304 - 1984
- [j5]Udi Manber:
A Probabilistic Lower Bound for Checking Disjointness of Sets. Inf. Process. Lett. 19(1): 51-53 (1984) - [j4]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) - [j3]Udi Manber, Richard E. Ladner:
Concurrency Control In a Dynamic Search Structure. ACM Trans. Database Syst. 9(3): 439-455 (1984) - [j2]Udi Manber:
Concurrent Maintenance of Binary Search Trees. IEEE Trans. Software Eng. 10(6): 777-784 (1984) - [c5]Shlomo Moran, Marc Snir, Udi Manber:
Applications of Ramsey's Theorem to Decision Trees Complexity (Preliminary Version). FOCS 1984: 332-337 - [c4]Udi Manber:
On Maintaining Dynamic Information in a Concurrent Environment (Preliminary Version). STOC 1984: 273-278 - 1982
- [c3]Udi Manber, Richard E. Ladner:
Concurrency Control in a Dynamic Search Structure. PODS 1982: 268-282 - [c2]Udi Manber, Martin Tompa:
Probabilistic, Nondeterministic, and Alternating Decision Trees. STOC 1982: 234-244 - 1981
- [c1]Udi Manber, Martin Tompa:
The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem. FOCS 1981: 220-227 - 1980
- [j1]Udi Manber:
System Diagnosis with Repair. IEEE Trans. Computers 29(10): 934-937 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
