Motwani, Rajeev
Overview
Works:  70 works in 270 publications in 5 languages and 3,491 library holdings 

Genres:  Conference papers and proceedings 
Roles:  Author, Editor, Contributor 
Publication Timeline
.
Most widely held works by
Rajeev Motwani
Randomized algorithms by
Rajeev Motwani(
)
43 editions published between 1993 and 2018 in English and held by 1,578 WorldCat member libraries worldwide
Presents basic tools from probability theory used in algorithmic applications, with concrete examples
43 editions published between 1993 and 2018 in English and held by 1,578 WorldCat member libraries worldwide
Presents basic tools from probability theory used in algorithmic applications, with concrete examples
Introduction to automata theory, languages, and computation by
John E Hopcroft(
Book
)
85 editions published between 1979 and 2014 in 5 languages and held by 1,026 WorldCat member libraries worldwide
It has been more than 20 years since this classic book on formal languages, automata theory, and computational complexity was first published. With this longawaited revision, the authors continue to present the theory in a concise and straightforward manner, now with an eye out for the practical applications. They have revised this book to make it more accessible to today's students, including the addition of more material on writing proofs, more figures and pictures to convey ideas, sideboxes to highlight other interesting material, and a less formal writing style. Exercises at the end of each chapter, including some new, easier exercises, help readers confirm and enhance their understanding of the material
85 editions published between 1979 and 2014 in 5 languages and held by 1,026 WorldCat member libraries worldwide
It has been more than 20 years since this classic book on formal languages, automata theory, and computational complexity was first published. With this longawaited revision, the authors continue to present the theory in a concise and straightforward manner, now with an eye out for the practical applications. They have revised this book to make it more accessible to today's students, including the addition of more material on writing proofs, more figures and pictures to convey ideas, sideboxes to highlight other interesting material, and a less formal writing style. Exercises at the end of each chapter, including some new, easier exercises, help readers confirm and enhance their understanding of the material
Database theory, ICDT 2003 : 9th international conference, Siena, Italy, January 810, 2003 : proceedings by
Diego Calvanese(
Book
)
19 editions published between 2002 and 2003 in English and held by 422 WorldCat member libraries worldwide
This book constitutes the refereed proceedings of the 9th International Conference on Database Theory, ICDT 2002, held in Siena, Italy in January 2002. The 26 revised full papers presented together with 3 invited articles were carefully reviewed and selected from 92 submissions. The papers are organized in topical sections on reasoning about XML schemas and queries, aggregate queries, query evaluation, query rewriting and reformulation, semistructured versus structured data, query containment, consistency and incompleteness, and data structures
19 editions published between 2002 and 2003 in English and held by 422 WorldCat member libraries worldwide
This book constitutes the refereed proceedings of the 9th International Conference on Database Theory, ICDT 2002, held in Siena, Italy in January 2002. The 26 revised full papers presented together with 3 invited articles were carefully reviewed and selected from 92 submissions. The papers are organized in topical sections on reasoning about XML schemas and queries, aggregate queries, query evaluation, query rewriting and reformulation, semistructured versus structured data, query containment, consistency and incompleteness, and data structures
Stable husbands by
Donald Erwin Knuth(
Book
)
5 editions published in 1988 in English and held by 13 WorldCat member 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
5 editions published in 1988 in English and held by 13 WorldCat member 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
Lecture notes on approximation algorithms by
Rajeev Motwani(
Book
)
4 editions published in 1992 in English and Undetermined and held by 11 WorldCat member libraries worldwide
Abstract: "These lecture notes are based on the course CS351 (Dept. of Computer Science, Stanford University) offered during the academic year 199192. 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."
4 editions published in 1992 in English and Undetermined and held by 11 WorldCat member libraries worldwide
Abstract: "These lecture notes are based on the course CS351 (Dept. of Computer Science, Stanford University) offered during the academic year 199192. 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."
Derandomization through approximation : an NC algorithm for minimum cuts by David Karger(
Book
)
2 editions published in 1993 in English and held by 8 WorldCat member 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."
2 editions published in 1993 in English and held by 8 WorldCat member 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."
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 811, 1998] by
Symposium on Foundations of Computer Science(
Book
)
2 editions published in 2001 in English and held by 7 WorldCat member libraries worldwide
2 editions published in 2001 in English and held by 7 WorldCat member libraries worldwide
Deferred data structuring by
Richard M Karp(
Book
)
1 edition published in 1986 in English and held by 6 WorldCat member 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
1 edition published in 1986 in English and held by 6 WorldCat member 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
On diameter verification and boolean matrix multiplication by
Julien Basch(
Book
)
2 editions published in 1995 in English and held by 5 WorldCat member 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
2 editions published in 1995 in English and held by 5 WorldCat member 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
Covering orthogonal polygons with star polygons : the perfect graph approach by
Rajeev Motwani(
Book
)
3 editions published in 1987 in English and held by 5 WorldCat member libraries worldwide
In general, orthogonal polygons can have concavities (dents) with four possible orientations. In this case, we show that the polygon covering problem can be reduced to the problem of covering a weakly triangulated graph with a minimum number of cliques. Since weakly triangulated graphs are perfect, we obtain the following duality relationship: the minimum number of star polygons needed to cover an orthogonal polygon P without holes is equal to the maximum number of points of P, no two of which can be con tained together in a covering star polygon. Further, the Ellipsoid method gives us a polynomial algorithm for this covering problem
3 editions published in 1987 in English and held by 5 WorldCat member libraries worldwide
In general, orthogonal polygons can have concavities (dents) with four possible orientations. In this case, we show that the polygon covering problem can be reduced to the problem of covering a weakly triangulated graph with a minimum number of cliques. Since weakly triangulated graphs are perfect, we obtain the following duality relationship: the minimum number of star polygons needed to cover an orthogonal polygon P without holes is equal to the maximum number of points of P, no two of which can be con tained together in a covering star polygon. Further, the Ellipsoid method gives us a polynomial algorithm for this covering problem
Approximation algorithms for the largest common subtree problem by
Sanjeev Khanna(
Book
)
2 editions published in 1995 in English and held by 5 WorldCat member 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)."
2 editions published in 1995 in English and held by 5 WorldCat member 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)."
Probabilistic analysis of network flow algorithms by
Richard M Karp(
Book
)
1 edition published in 1987 in English and held by 5 WorldCat member libraries worldwide
1 edition published in 1987 in English and held by 5 WorldCat member 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 WorldCat member libraries worldwide
2 editions published between 1987 and 1988 in English and held by 5 WorldCat member libraries worldwide
Probabilistic analysis of matching and network flow algorithms by
Rajeev Motwani(
)
2 editions published in 1988 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 1988 in English and held by 4 WorldCat member libraries worldwide
Einführung in die Automatentheorie, formale Sprachen und Berechenbarkeit by
John E Hopcroft(
)
1 edition published in 2011 in German and held by 4 WorldCat member libraries worldwide
1 edition published in 2011 in German and held by 4 WorldCat member libraries worldwide
Introducción a la teoría de autómatas, lenguajes y computación (3a. ed.) by
John E Hopcroft(
Book
)
1 edition published in 2007 in Spanish and held by 4 WorldCat member libraries worldwide
1 edition published in 2007 in Spanish and held by 4 WorldCat member libraries worldwide
Proceedings of the second SIAM International Conference on Data Mining by
International Conference on Data Mining(
Book
)
2 editions published in 2002 in English and held by 3 WorldCat member libraries worldwide
2 editions published in 2002 in English and held by 3 WorldCat member libraries worldwide
The probabilistic method yields deterministic parallel algorithms by
Rajeev Motwani(
Book
)
2 editions published in 1989 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We present a technique for converting RNC algorithms into NC algorithms. Our approach is based on a parallel implementation of the method of conditional probabilities. This method was used to convert probabilistic proofs of existence of combinatorial structures into polynomial time deterministic algorithms. It has the apparent drawback of being extremely sequential in nature. We show certain general conditions under which it is possible to use this technique for devising deterministic parallel algorithms. We use our technique to devise an NC algorithm for the set balancing problem."
2 editions published in 1989 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We present a technique for converting RNC algorithms into NC algorithms. Our approach is based on a parallel implementation of the method of conditional probabilities. This method was used to convert probabilistic proofs of existence of combinatorial structures into polynomial time deterministic algorithms. It has the apparent drawback of being extremely sequential in nature. We show certain general conditions under which it is possible to use this technique for devising deterministic parallel algorithms. We use our technique to devise an NC algorithm for the set balancing problem."
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Raghavan, Prabhakar
 Hopcroft, John E. 1939 Author
 Ullman, Jeffrey D. 1942 Contributor
 Lenzerini, Maurizio Editor
 Calvanese, Diego Author Editor
 Stanford University Computer Science Department
 Knuth, Donald Erwin 1938 Author
 Alfonseca, Manuel Translator
 Pittel, Boris
 Pighizzini, Giovanni
Useful Links
Associated Subjects
Algebra, Boolean Algorithms Approximation theoryData processing Combinatorial analysis Computational complexity Computer algorithms Computers Computer science Database management Data mining Data structures (Computer science) Formal languages Information storage and retrieval systems Lattice theory Logic, Symbolic and mathematical Machine theory Management information systems MarriageMathematical models Marriage theorem Matching theory Parallel programming (Computer science) Probabilities ProbabilitiesData processing Proof theory Random walks (Mathematics) Search theory Set theory Stochastic processes Stochastic processesData processing Trees (Graph theory)
Covers
Alternative Names
Raciv Motvani
Radžív Mótvání
Rajeev Motwani docente indiano
Rajeev Motwani Indiaas wiskundige (19622009)
Rajeev Motwani Indian theoretical computer scientist and venture capitalist at Stanford University (1962–2009)
Rajeev Motwani indischer Informatiker
Rajeev Motwani indisk datavetare och matematiker
Rajeev Motwani indisk informatikar og matematikar
Rajeev Motwani indisk informatiker og matematiker
Мотвани, Раджив
রাজীব মোতওয়ানি
モトワニ, R
Languages