And Now Google's Vice President of Engineering - Udi Manber

I've been following Udi Manber for some time now; his work as Yahoo! chief scientist and later at Amazon / A9, Udi is author of several books and research papers[1]. He's among few people who are zealous about academia's close participation in industry. Good news is,  he is now @ Google...

Amazon.com Unit Exec Takes Post at Google  (AP)

Udi Manber Leaves Post at Amazon.com Subsidiary to Become
Google's Vice President of Engineering

SEATTLE (AP) -- The head of Amazon.com Inc.'s online search effort is leaving to
join Google Inc., the latest in a series of high-profile hires for the search
engine leader...
read more

[1] Udi Manber's Papers Published in ACM

A text compression scheme that allows fast searching directly in the compressed file
Udi Manber April 1997  
ACM Transactions on Information Systems (TOIS),  Volume 15 Issue 2

On maintaining dynamic information in a concurrent environment

Udi Manber December 1984          
Proceedings of the sixteenth annual ACM symposium on Theory of computing

Probabilistic, nondeterministic, and alternating decision trees (Preliminary Version)
Udi Manber, Martin Tompa
May 1982          
Proceedings of the fourteenth annual ACM symposium on Theory of computing
   
This work generalizes decision trees in order to model algorithms which allow probabilistic, nondeterministic, or alternating control. Two geometric techniques for proving lower bounds on the time required by ordinary decision trees (Dobkin and Lipton's -&-ldquo;region-counting-&-rdquo; technique as applied to the knapsack and element uniqueness problems [1], and Reingold's technique as applied to set equality [4]) are shown to be special cases of one unified technique, which in fact applie ...

Session 10: Concurrency control in a dynamic search structure
Udi Manber, Richard E. Ladner
March 1982          
Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems

Applications of Ramsey's theorem to decision tree complexity
Shlomo Moran, Marc Snir, Udi Manber
October 1985          
Journal of the ACM (JACM),  Volume 32 Issue 4
   
Combinatorial techniques for extending lower bound results for decision trees to general types of queries are presented. Problems that are defined by simple inequalities between inputs, called order invariant problems, are considered. A decision tree is called k-bounded if each query depends on at most k variables. No further assumptions on the type of queries are made. It is proved that one can replace the queries of any k ...

Using induction to design algorithms

Udi Manber
November 1988          
Communications of the ACM,  Volume 31 Issue 11

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.
 
The complexity of problems on probabilistic, nondeterministic, and alternating decision trees
Udi Manber, Martin Tompa
July 1985          
Journal of the ACM (JACM),  Volume 32 Issue 3

This work generalizes decision trees in order to study lower bounds on the running times of algorithms that allow probabilistic, nondeterministic, or alternating control. It is shown that decision trees that are allowed internal randomization (at the expense of introducing a small probability of error) run no faster asymptotically than ordinary decision trees for a collection of natural problems. Two geometric techniques from the literature for proving lower bounds on the time required by o ...
 
Experience with personalization of Yahoo!
Udi Manber, Ash Patel, John Robison
August 2000          
Communications of the ACM,  Volume 43 Issue 8

Suffix arrays: a new method for on-line string searches

Udi Manber, Gene Myers
January 1990          
Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics

Integrating content-based access mechanisms with hierarchical file systems
Burra Gopal, Udi Manber
February 1999          
Proceedings of the third symposium on Operating systems design and implementation
Publisher: USENIX Association

How to find it (abstract): research issues in distributed search
Udi Manber
June 1998          
Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing

How to find it (abstract): research issues in distributed search

Udi Manber
June 1998          
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures

Future directions and research problems in the World Wide Web
Udi Manber
June 1996          
Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Publisher: ACM Press

DIB—a distributed implementation of backtracking
Raphael Finkel, Udi Manber
March 1987          
ACM Transactions on Programming Languages and Systems (TOPLAS),  Volume 9 Issue 2

DIB is a general-purpose package that allows a wide range of applications such as recursive backtrack, branch and bound, and alpha-beta search to be implemented on a multicomputer. It is very easy to use. The application program needs to specify only the root of the recursion tree, the computation to be performed at each node, and how to generate children at each node. In addition, the application program may optionally specify how to synthesize values of tree nodes from their children's va ...

A text compression scheme that allows fast searching directly in the compressed file
Udi Manber April 1997          
ACM Transactions on Information Systems (TOIS),  Volume 15 Issue 2

A new text compression scheme is presented in this article. The main purpose of this scheme is to speed up string matching by searching the compressed file directly. The scheme requires no modification of the string-matching algorithm, which is used as a black box; any string-matching procedure can be used. Instead, the pattern is modified; only the outcome of the matching of the modified pattern against the compressed file is decompressed. Since the compressed file is smal ...

Scalable Internet resource discovery: research problems and approaches
C. Mic Bowman, Peter B. Danzig, Udi Manber, Michael F. Schwartz
August 1994          
Communications of the ACM,  Volume 37 Issue 8

Fast text searching: allowing errors
Sun Wu, Udi Manber
October 1992          
Communications of the ACM,  Volume 35 Issue 10

Flying through hypertext
Patrick Lai, Udi Manber
September 1991          
Proceedings of the third annual ACM conference on Hypertext

Share