Most widely held works by Rajeev Motwani
Randomized algorithms by Rajeev Motwani ( Book )
17 editions published between 1993 and 2007 in English and held by 633 libraries worldwide
Introduction to automata theory, languages, and computation by John E Hopcroft ( Book )
31 editions published between 2000 and 2011 in 3 languages and held by 557 libraries worldwide
"This classic book on formal languages, automata theory, and computational complexity has been updated to present theoretical concepts in a concise and straightforward manner with increased coverage of practical applications. This third edition offers students a less formal writing style while providing the most accessible coverage of automata theory available, solid treatment on constructing proofs, many figures and diagrams to help convey ideas, and sidebars to highlight related material. A new feature of this edition is Gradiance, a Web-based homework and assessment tool. Each chapter offers an abundance of exercises, including selected Gradiance problems, for a true hands-on learning experience for students."--BOOK JACKET.
Database theory, ICDT 2003 : 9th international conference, Siena, Italy, January 8-10, 2003 : proceedings by International Conference on Database Theory ( Book )
3 editions published in 2003 in English and held by 197 libraries worldwide
Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie by John E Hopcroft ( Book )
3 editions published between 2002 and 2011 in German and Undetermined and held by 62 libraries worldwide
Database theory, ICDT 2003 9th international conference, Siena, Italy, January 8-10, 2003 : proceedings by International Conference on Database Theory ( Book )
3 editions published between 2002 and 2003 in English and held by 17 libraries worldwide
Introducción a la teoría de autómatas, lenguajes y computación by John E Hopcroft ( Book )
7 editions published between 2002 and 2008 in Spanish and held by 15 libraries worldwide
Stable husbands by Donald Erwin Knuth ( Book )
3 editions published in 1988 in English and held by 13 libraries worldwide
Suppose n boys and n girls rank each other at random. We show that any particular girl has at least (1/2-[Eta])ln n and at least (1 + [Eta])ln n different husbands in the set of all Gale/Shapley stable matchings defined by these rankings, with probability approaching 1 as n [approaches] [infinity], if [Eta] is any positive constant. The proof emphasizes general methods that appear to be useful for the analysis of many other combinatorial algorithms.
Einführung in die Automatentheorie, Formale Sprachen und Komplexitätstheorie by John E Hopcroft. ( Book )
1 edition published in 2002 in German and held by 10 libraries worldwide
Derandomization through approximation : an NC algorithm for minimum cuts by David Karger ( Book )
2 editions published in 1993 in English and held by 9 libraries worldwide
Abstract: "We prove that the minimum cut problem can be solved in NC on arbitrarily weighted undirected graphs. We do so by giving three separate and independently interesting results. The first is a relatively straightforward NC (2 + [epsilon])-approximation algorithm for the minimum cut. It uses O(m²/n) processors. The second result is a randomized reduction of the minimum cut problem to the minimum cut approximation problem. The third is a derandomization of this reduction. Performing the derandomization requires a novel combination of two previously known derandomization techniques: pairwise independence and random walks on expanders."
On diameter verification and boolean matrix multiplication by Julien Basch ( Book )
2 editions published in 1995 in English and held by 7 libraries worldwide
Abstract: "We present a practical algorithm that verifies whether a graph has diameter 2 in time O (n³/log²n). A slight adaptation of this algorithm yields a boolean matrix multiplication algorithm which runs in the same time bound; thereby allowing us to compute transitive closure and verification of the diameter of a graph for any constant d in O (n³/log²n) time.
Deferred data structuring by Richard M Karp ( Book )
2 editions published in 1986 in English and held by 7 libraries worldwide
We consider the problem of answering a series of on- line queries on a static data set. The conventional approach to such problems involves a preprocessing phase which constructs a data structure with good search behavior. The data structure representing the data set then remains fixed throughout the processing of the queries. Our approach involves dynamic or query driven structuring of the data set; our algorithm processes the data set only when doing so is required for answering a query. A data structure constructed progressively in this fashion is called a deferred data structure.
Database theory : 9th international conference ; proceedings ( Book )
1 edition published in 2003 in English and held by 7 libraries worldwide
Lecture notes on approximation algorithms by Rajeev Motwani ( Book )
in English and held by 7 libraries worldwide
Abstract: "These lecture notes are based on the course CS351 (Dept. of Computer Science, Stanford University) offered during the academic year 1991-92. The notes below correspond to the first half of the course. The second half consists of topics such as MAX SNP, cliques, and colorings, as well as more specialized material covering topics such as geometric problems, Steiner trees and multicommodity flows. The second half is being revised to incorporate the implciations of recent results in approximation algorithms and the complexity of approximation problems."
Database theory ICDT 2003 : 9th international conference, Siena, Italy, January 8-10, 2003 : proceedings by International Conference on Database Theory ( Book )
1 edition published in 2003 in English and held by 6 libraries worldwide
Probabilistic analysis of network flow algorithms by Richard M Karp ( Book )
2 editions published in 1987 in English and held by 6 libraries worldwide
Special issue on FOCS 98 : [nine papers whose preliminary versions appeared in the proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, held at Palo Alto, California, on November 8 - 11, 1998 ( Book )
1 edition published in 2001 in English and held by 6 libraries worldwide
Approximation algorithms for the largest common subtree problem by Sanjeev Khanna ( Book )
1 edition published in 1995 in English and held by 6 libraries worldwide
Abstract: "The largest common subtree problem is to find a largest tree which occurs as a common subgraph in a given collection of trees. Let n denote the number of vertices in the largest tree in the collection. We show that in the case of bounded degree trees, it is possible to achieve an approximation ratio of O(n(log log n)/log²n). For unbounded degree trees, we give an algorithm with approximation ratio O(n(log log n)²/log²n) when the trees are unlabeled. An approximation ratio of O(n(log log n)²/log²n) is also achieved for the case of labeled unbounded degree trees provided the number of distinct labels is O(log[superscript 0(1)]n)."
Database theory - ICDT 2003 : 9th international conference, Siena, Italy, January 8-10, 2003 : proceedings ( Book )
1 edition published in 2003 in English and held by 5 libraries worldwide
Perfect graphs and orthogonally convex covers by Rajeev Motwani ( Book )
2 editions published between 1987 and 1988 in English and held by 5 libraries worldwide
Covering orthogonal polygons with star polygons : the perfect graph approach by Rajeev Motwani ( Book )
2 editions published in 1987 in English and held by 5 libraries worldwide
Algebra, Boolean Algorithms Approximation theory--Data processing Cluster set theory Combinatorial analysis Computational complexity Computer science Conference proceedings Database management Data mining Data structures (Computer science) Dissertations, Academic Formal languages Information storage and retrieval systems Lattice theory Logic, Symbolic and mathematical Machine theory Management information systems Marriage--Mathematical models Marriage theorem Matching theory Parallel programming (Computer science) Probabilities Proof theory Random walks (Mathematics) Robotics Search theory Set theory Stochastic processes--Data processing Trees (Graph theory) University of California, Berkeley.--Computer Science Division