Остановите войну!
for scientists:
default search action
Udi Manber
- > Home > Persons > Udi Manber
Publications
- 1996
- [j31]Sun Wu, Udi Manber, Eugene W. Myers:
A Subquadratic Algorithm for Approximate Limited Expression Matching. Algorithmica 15(1): 50-67 (1996) - 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
- [j26]Udi Manber, Sun Wu:
An Algorithm for Approximate Membership checking with Application to Password Security. Inf. Process. Lett. 50(4): 191-197 (1994) - [c18]Ricardo A. Baeza-Yates, Walter Cunto, Udi Manber, Sun Wu:
Proximity Matching Using Fixed-Queries Trees. CPM 1994: 198-212 - [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
- [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) - 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 - 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) - [c11]Noga Alon, Amnon Barak, Udi Manber:
On Disseminating Information Reliably without Broadcasting. ICDCS 1987: 74-81 - 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) - [c7]Albert G. Greenberg, Udi Manber:
A Probabilistic Pipeline Algorithm for K-Selection on the Tree Machine. ICPP 1985: 1-5 - 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) - [c5]Shlomo Moran, Marc Snir, Udi Manber:
Applications of Ramsey's Theorem to Decision Trees Complexity (Preliminary Version). FOCS 1984: 332-337 - 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
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 2024-02-06 23:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint