Udi Manber | Academic Influence

Udi Manber's AcademicInfluence.com Rankings

Udi Manber

Computer Science

#370

World Rank

#385

Historical Rank

#210

USA Rank

Algorithms

#10

World Rank

#10

Historical Rank

#3

USA Rank

Database

#1262

World Rank

#1330

Historical Rank

#348

USA Rank

computer-science Degrees

Download Badge

Computer Science

Udi Manber's Degrees

PhD Computer Science University of Washington
Masters Computer Science University of Washington

Similar Degrees You Can Earn

Why Is Udi Manber Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Udi Manber is an Israeli computer scientist. He is one of the authors of agrep and GLIMPSE. After a career in engineering and management, he worked on medical research. Education He earned both his bachelor's degree in 1975 in mathematics and his master's degree in 1978 from the Technion in Israel. At the University of Washington, he earned another master's degree in 1981 and his PhD in computer science in 1982.

(See a Problem?)

Udi Manber's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Suffix arrays: a new method for on-line string searches (1993) (2410)
Fast text searching: allowing errors (1992) (843)
Finding Similar Files in a Large File System (1994) (724)
A FAST ALGORITHM FOR MULTI-PATTERN SEARCHING (1999) (587)
The Harvest Information Discovery and Access System (1995) (535)
Introduction to algorithms - a creative approach (1989) (498)
GLIMPSE: A Tool to Search Through Entire File Systems (1994) (358)
Harvest: A Scalable, Customizable Discovery and Access System (1994) (284)
Scalable Internet resource discovery: research problems and approaches (1994) (272)
Experience with personalization of Yahoo! (2000) (267)
DIB—a distributed implementation of backtracking (1987) (228)
Proximity Matching Using Fixed-Queries Trees (1994) (212)
Two algorithms for barrier synchronization (1988) (168)
A text compression scheme that allows fast searching directly in the compressed file (1994) (156)
Integrating content-based access mechanisms with hierarchical file systems (1999) (130)
An O(NP) Sequence Comparison Algorithm (1990) (129)
An Algorithm for String Matching with a Sequence of don't Cares (1991) (115)
A simple scheme to make passwords based on one-way functions much harder to crack (1996) (110)
Liquid Software: A New Paradigm for Networked Systems (1996) (105)
WebGlimpse: combining browsing and searching (1997) (102)
Deducing Similarities in Java Sources from Bytecodes (1998) (91)
An Algorithm for Approximate Membership checking with Application to Password Security (1994) (90)
Introduction to algorithms (1989) (89)
Concurrency control in a dynamic search structure (1984) (78)
Approximate Multiple Strings Search (1996) (75)
APPROXIMATE MULTIPLE STRING SEARCH (1996) (65)
On Disseminating Information Reliably without Broadcasting (1987) (64)
Pierce point minimization and optimal torch path determination in flame cutting (1984) (59)
A subquadratic algorithm for approximate limited expression matching (2005) (55)
A Subquadratic Algorithm for Approximate Regular Expression Matching (1995) (50)
APPROXIMATE STRING MATCHING WITH ARBITRARY COSTS FOR TEXT AND HYPERTEXT (1993) (42)
The Search Broker (1997) (41)
Connecting Diverse Web Search Facilities (1998) (41)
Applications of Ramsey's theorem to decision tree complexity (1985) (40)
Fast Text Searching With Errors (2005) (37)
On maintaining dynamic information in a concurrent environment (1984) (35)
Scalable Internet resource discovery : research problems and approaches : Internet technology (1994) (33)
Distributed round-robin and first-come first-serve protocols and their applications to multiprocessor bus arbitration (1988) (31)
The effect of number of Hamiltonian paths on the complexity of a vertex-coloring problem (1981) (30)
Concurrent Maintenance of Binary Search Trees (1984) (26)
The complexity of problems on probabilistic, nondeterministic, and alternating decision trees (1985) (25)
Flying through hypertext (1991) (25)
Using induction to design algorithms (1988) (23)
A Sub-quadratic Algorithm for Approximate Limited Expression Matching 1 (1992) (23)
On non-intersecting Eulerian circuits (1987) (22)
Probabilistic, Nondeterministic, and Alternating Decision Trees (1982) (21)
System Diagnosis with Repair (1980) (21)
Chain reactions in networks (1990) (15)
Probabilistic, nondeterministic, and alternating decision trees (Preliminary Version) (1982) (13)
Distributed computation via active messages (1985) (12)
The business of personalization: experience with personalization of Yahoo! (2000) (12)
Recognizing Breadth-First Search Trees in Linear Time (1990) (9)
Future directions and research problems in the World Wide Web (1996) (8)
Concurrency control in a dynamic search structure (1982) (8)
A FAST APPROXIMATE PATTERN-MATCHING TOOL ( Preliminary version ) (1992) (7)
A Probabilistic Distributed Algorithm for Set Intersection and its Analysis (1987) (7)
Creating a Personal Web Notebook (1997) (5)
Path-matching problems (1992) (4)
The use of customized emphasis in text visualization (1997) (4)
A Probabilistic Pipeline Algorithm for K Selection on the Tree Machine (1987) (4)
Proceedings of the Third Annual Symposium on Combinatorial Pattern Matching (1992) (4)
Efficient searching for specific resources on the World-Wide Web: creation of a search server for radiologists. (1996) (3)
Active Channels and Their Applications to Parallel Computing (1987) (3)
A Probabilistic Lower Bound for Checking Disjointness of Sets (1984) (3)
Computer science: research and applications (1992) (3)
Distributed round-robin and first-come first-serve protocols and their application to multiprocessor bus arbitrary (1988) (3)
Applications of Ramsey's Theorem to Decision Trees Complexity (Preliminary Version) (1984) (3)
Finding anything in the billion page Web: are algorithms the key? (1999) (2)
The Complexity of Controlled Selection (1989) (2)
A Probabilistic Distributed Algorithm for Set Intersection and Its Analysis (Preliminary Version) (1985) (1)
mu. - A system for simulating and implementing distributed and parallel algorithms (1987) (1)
Concurrency control for dynamic data structures and fault tolerance (1982) (1)
An algorithm for min-cost edge-disjoint cycles and its applications (1992) (1)
Efficient storage of nonadaptive routing tables (1988) (1)
DESIGNING ALGORITHMS INCREMENTALLY (1999) (1)
COMBINING BROWSING AND SEARCHING ( Preliminary Version ) (2007) (0)
Future Directions and Research Problems in the World Wide Web (Abstract). (1996) (0)
Customer-centric innovations for search and e-commerce (2004) (0)
Think Big (2020) (0)
System and method for collecting ground view images (2005) (0)
How to find it (abstract): research issues in distributed search (1998) (0)
How to Find It: Research Issues in Distributed Search (Abstract). (1998) (0)
Shift Arithmetic on a Token Ring Network (1985) (0)
The Algorithm 2 . 1 . Outline of the Algorithm (1994) (0)
IMPROVING THE RUNNING TIMES FOR SOME STRING-MATCHING PROBLEMS (2013) (0)
How to find it (abstract): research issues in distributed search (1998) (0)
An analogy between proving mathematical theorems and designing computer algorithms provides an elegant methodology for designing algorithms, explaining their behavior, and understanding their key ideas. (1988) (0)

This paper list is powered by the following services:

Other Resources About Udi Manber

en.wikipedia.org

What Schools Are Affiliated With Udi Manber?

Udi Manber is affiliated with the following schools:

Image Attributions

Image Source for Udi Manber