WorldCat Identities

Motwani, Rajeev

Overview
Works: 59 works in 189 publications in 4 languages and 2,291 library holdings
Genres: Conference proceedings 
Roles: Editor, Contributor
Classifications: QA267, 629.8312
Publication Timeline
Key
Publications about  Rajeev Motwani Publications about Rajeev Motwani
Publications by  Rajeev Motwani Publications by Rajeev Motwani
posthumous Publications by Rajeev Motwani, published posthumously.
Most widely held works by Rajeev Motwani
Introduction to automata theory, languages, and computation by John E Hopcroft ( Book )
64 editions published between 1979 and 2011 in 4 languages and held by 1,002 WorldCat member 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
Randomized algorithms by Rajeev Motwani ( Book )
30 editions published between 1993 and 2007 in English and held by 802 WorldCat member libraries worldwide
Presents basic tools from probability theory used in algorithmic applications, with concrete examples
Database theory, ICDT 2003 : 9th international conference, Siena, Italy, January 8-10, 2003 : proceedings by Diego Calvanese ( Book )
14 editions published between 2002 and 2003 in English and held by 291 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
Database theory : 9th international conference ; proceedings ( Book )
2 editions published in 2003 in English and held by 30 WorldCat member libraries worldwide
Einführung in Automatentheorie, formale Sprachen und Berechenbarkeit by John E Hopcroft ( Book )
1 edition published in 2011 in German and held by 28 WorldCat member libraries worldwide
Stable husbands by Donald Ervin Knuth ( Book )
4 editions published between 1988 and 1990 in English and held by 14 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
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."
Lecture notes on approximation algorithms by Rajeev Motwani ( Book )
in English and held by 7 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 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."
Deferred data structuring by Richard M Karp ( Book )
2 editions 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 6 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
Approximation algorithms for the largest common subtree problem by Stanford University ( Book )
2 editions published in 1995 in English and held by 6 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)."
Perfect graphs and orthogonally convex covers by Rajeev Motwani ( Book )
3 editions published between 1987 and 1988 in English and held by 5 WorldCat member libraries worldwide
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
We consider the problem of covering simple orthogonal polygons with star polygons. A star polygon contains a point p, such that for every point q in the star polygon, there is an orthogonally convex polygon containing p and q
Probabilistic analysis of network flow algorithms by Richard M Karp ( Book )
2 editions published in 1987 in English and held by 5 WorldCat member libraries worldwide
Einführung in Automatentheorie, formale Sprachen und Berechenbarkeit i Informatik ( )
1 edition published in 2011 in German and held by 4 WorldCat member libraries worldwide
Lecture notes on approximation algorithms by Rajeev Motwani ( Book )
3 editions published in 1992 in English and held by 4 WorldCat member libraries worldwide
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 AL4X 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 implications of recent results in approximation algorithms and the complexity of approximation problems. Please let me know if you would like to be on the mailing list for the second half. Comments, criticisms and corrections are welcome, please send them by electronic mail to rajeev@cs. Stanford.edu
Algorithmic foundations of robotics ( Book )
2 editions published in 2000 in English and held by 3 WorldCat member libraries worldwide
Proceedings of the second SIAM International Conference on Data Mining by SIAM International Conference on Data Mining ( Book )
2 editions published in 2002 in English and held by 3 WorldCat member libraries worldwide
Next generation of data mining by Hillol Kargupta ( Book )
2 editions published in 2009 in English and held by 3 WorldCat member libraries worldwide
Drawn from the US National Science Foundation's Symposium on Next Generation of Data Mining and Cyber-Enabled Discovery for Innovation (NGDM 07), this work explores technologies and applications in data mining as well as potential challenges faced by the field
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.63 (from 0.35 for Einführun ... to 0.97 for Covering o ...)
Alternative Names
モトワニ, R
Languages
English (120)
German (10)
Spanish (9)
Italian (4)
Covers