| |
 |      |
                                               |
Note: Links lead to the DBLP on the Web. Sudipto Guha Sudipto Guha, Nick Koudas , Divesh Srivastava , Xiaohui Yu : Reasoning About Approximate Match Query Results. ICDE 2006 : 8 Sudipto Guha, Boulos Harb : Approximation algorithms for wavelet transform coding of data streams. SODA 2006 : 698-707 Sudipto Guha, Andrew McGregor , Suresh Venkatasubramanian : Streaming and sublinear approximation of entropy and information distances. SODA 2006 : 733-742 Chandra Chekuri , Sudipto Guha, Joseph Naor : The Steiner k -Cut Problem. SIAM J. Discrete Math. 20 (1): 261-271 (2006) Sudipto Guha, Boulos Harb : Wavelet synopsis for data streams: minimizing non-euclidean error. KDD 2005 : 88-97 Sudipto Guha, Kyuseok Shim : Offline and Data Stream Algorithms for Efficient Computation of Synopsis Structures. VLDB 2005 : 1364 Sudipto Guha: Space Efficiency in Synopsis Construction Algorithms. VLDB 2005 : 409-420 Julia Chuzhoy , Sudipto Guha, Eran Halperin , Sanjeev Khanna , Guy Kortsarz , Robert Krauthgamer , Joseph Naor : Asymmetric k -center is log * n -hard to approximate. J. ACM 52 (4): 538-551 (2005) Moses Charikar , Sudipto Guha: Improved Combinatorial Algorithms for Facility Location Problems. SIAM J. Comput. 34 (4): 803-824 (2005) Tugkan Batu , Sudipto Guha, Sampath Kannan : Inferring Mixtures of Markov Chains. COLT 2004 : 186-199 Julia Chuzhoy , Sudipto Guha, Sanjeev Khanna , Joseph Naor : Machine Minimization for Scheduling Jobs with Interval Constraints. FOCS 2004 : 81-90 Julia Chuzhoy , Sudipto Guha, Eran Halperin , Sanjeev Khanna , Guy Kortsarz , Joseph Naor : Asymmetric k-center is log * n -hard to approximate. STOC 2004 : 21-27 Sudipto Guha, Chulyun Kim , Kyuseok Shim : XWAVE: Approximate Extended Wavelets for Streaming Data. VLDB 2004 : 288-299 Sudipto Guha, Kyuseok Shim , Jungchul Woo : REHIST: Relative Error Histogram Construction Algorithms. VLDB 2004 : 300-311 Sudipto Guha, Nick Koudas , Amit Marathe , Divesh Srivastava : Merging the Results of Approximate Match Operations. VLDB 2004 : 636-647 Rajeev Alur , Swarat Chaudhuri , Kousha Etessami , Sudipto Guha, Mihalis Yannakakis : Compression of Partially Ordered Strings. CONCUR 2003 : 42-56 Chandra Chekuri , Sudipto Guha, Joseph Naor : Approximating Steiner k-Cuts. ICALP 2003 : 189-199 Sudipto Guha, Nick Koudas , Divesh Srivastava , Ting Yu : Index-Based Approximate XML Joins. ICDE 2003 : 708-710 Sudipto Guha, Dimitrios Gunopulos , Nick Koudas : Correlating synchronous and asynchronous data streams. KDD 2003 : 529-534 Sudipto Guha, Shankar Krishnan , Kamesh Munagala , Suresh Venkatasubramanian : Application of the two-sided depth test to CSG rendering. SI3D 2003 : 177-180 Sudipto Guha, Dimitrios Gunopulos , Nick Koudas , Divesh Srivastava , Michail Vlachos : Efficient Approximation Of Optimization Queries Under Parametric Aggregation Constraints. VLDB 2003 : 778-789 Sudipto Guha, Rajeev Rastogi , Kyuseok Shim : Techniques for Clustering Massive Data Sets. Clustering and Information Retrieval 2003 : 35-82 Sudipto Guha, Athina Markopoulou , Fouad A. Tobagi : Hierarchical Reliable Multicast: Performance Analysis and Optimal Placement of Proxies. Computer Communications 26 (18): 2070-2081 (2003) Julia Chuzhoy , Sudipto Guha, Sanjeev Khanna , Joseph Naor : Asymmetric k-center is log * n-hard to Approximate Electronic Colloquium on Computational Complexity (ECCC) (038): (2003) Sudipto Guha, Adam Meyerson , Nina Mishra , Rajeev Motwani , Liadan O'Callaghan : Clustering Data Streams: Theory and Practice. IEEE Trans. Knowl. Data Eng. 15 (3): 515-528 (2003) Sudipto Guha, Refael Hassin , Samir Khuller , Einat Or : Capacitated vertex covering. J. Algorithms 48 (1): 257-270 (2003) Sudipto Guha, Adam Meyerson , Kamesh Munagala : A constant factor approximation algorithm for the fault-tolerant facility location problem. J. Algorithms 48 (2): 429-440 (2003) Sudipto Guha, Piotr Indyk , S. Muthukrishnan , Martin Strauss : Histogramming Data Streams with Fast Per-Item Processing. ICALP 2002 : 681-692 Sudipto Guha, Nick Koudas : Approximating a Data Stream for Querying and Estimation: Algorithms and Performance Evaluation. ICDE 2002 : 567- Liadan O'Callaghan , Adam Meyerson , Rajeev Motwani , Nina Mishra , Sudipto Guha: Streaming-Data Algorithms for High-Quality Clustering. ICDE 2002 : 685- Sudipto Guha, Nick Koudas , Divesh Srivastava : Fast Algorithms For Hierarchical Range Histogram Construction. PODS 2002 : 180-187 Sudipto Guha, H. V. Jagadish , Nick Koudas , Divesh Srivastava , Ting Yu : Approximate XML joins. SIGMOD Conference 2002 : 287-298 Nitin Thaper , Sudipto Guha, Piotr Indyk , Nick Koudas : Dynamic multidimensional histograms. SIGMOD Conference 2002 : 428-439 Sudipto Guha, Kamesh Munagala : Improved algorithms for the data placement problem. SODA 2002 : 106-107 Sudipto Guha, Kamesh Munagala : Generalized clustering. SODA 2002 : 484-485 Amotz Bar-Noy , Sudipto Guha, Yoav Katz , Joseph Naor , Baruch Schieber , Hadas Shachnai : Throughput maximization of real-time scheduling with batching. SODA 2002 : 742-751 Sudipto Guha, Refael Hassin , Samir Khuller , Einat Or : Capacitated vertex covering with applications. SODA 2002 : 858-865 Anna C. Gilbert , Sudipto Guha, Piotr Indyk , S. Muthukrishnan , Martin Strauss : Near-optimal sparse fourier representations via sampling. STOC 2002 : 152-161 Anna C. Gilbert , Sudipto Guha, Piotr Indyk , Yannis Kotidis , S. Muthukrishnan , Martin Strauss : Fast, small-space algorithms for approximate histogram maintenance. STOC 2002 : 389-398 Moses Charikar , Sudipto Guha, Éva Tardos , David B. Shmoys : A Constant-Factor Approximation Algorithm for the k-Median Problem. J. Comput. Syst. Sci. 65 (1): 129-149 (2002) Guy Even , Sudipto Guha, Baruch Schieber : Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas. SIAM J. Comput. 32 (1): 231-252 (2002) Sudipto Guha, Adam Meyerson , Kamesh Munagala : Improved algorithms for fault tolerant facility location. SODA 2001 : 636-641 Sudipto Guha, Adam Meyerson , Kamesh Munagala : A constant factor approximation for the single sink edge installation problems. STOC 2001 : 383-388 Sudipto Guha, Nick Koudas , Kyuseok Shim : Data-streams and histograms. STOC 2001 : 471-475 Sudipto Guha, Rajeev Rastogi , Kyuseok Shim : Cure: An Efficient Clustering Algorithm for Large Databases. Inf. Syst. 26 (1): 35-58 (2001) Amotz Bar-Noy , Sudipto Guha, Joseph Naor , Baruch Schieber : Approximating the Throughput of Multiple Machines in Real-Time Scheduling. SIAM J. Comput. 31 (2): 331-352 (2001) Sudipto Guha: Nested Graph Dissection and Approximation Algorithms. FOCS 2000 : 126-135 Sudipto Guha, Nina Mishra , Rajeev Motwani , Liadan O'Callaghan : Clustering Data Streams. FOCS 2000 : 359-366 Sudipto Guha, Adam Meyerson , Kamesh Munagala : Hierarchical Placement and Network Design Problems. FOCS 2000 : 603-612 Guy Even , Sudipto Guha, Baruch Schieber : Improved approximations of crossings in graph drawings. STOC 2000 : 296-305 Sudipto Guha, Rajeev Rastogi , Kyuseok Shim : ROCK: A Robust Clustering Algorithm for Categorical Attributes. Inf. Syst. 25 (5): 345-366 (2000) Amotz Bar-Noy , Sudipto Guha, Joseph Naor , Baruch Schieber : Message Multicasting in Heterogeneous Networks. SIAM J. Comput. 30 (2): 347-358 (2000) Moses Charikar , Sudipto Guha: Improved Combinatorial Algorithms for the Facility Location and k-Median Problems. FOCS 1999 : 378-388 Sudipto Guha, Rajeev Rastogi , Kyuseok Shim : ROCK: A Robust Clustering Algorithm for Categorical Attributes. ICDE 1999 : 512-521 Moses Charikar , Sudipto Guha, Éva Tardos , David B. Shmoys : A Constant-Factor Approximation Algorithm for the k -Median Problem (Extended Abstract). STOC 1999 : 1-10 Sudipto Guha, Anna Moss , Joseph Naor , Baruch Schieber : Efficient Recovery from Power Outage (Extended Abstract). STOC 1999 : 574-582 Amotz Bar-Noy , Sudipto Guha, Joseph Naor , Baruch Schieber : Approximating the Throughput of Multiple Machines Under Real-Time Scheduling. STOC 1999 : 622-631 Sudipto Guha, Samir Khuller : Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets. Inf. Comput. 150 (1): 57-74 (1999) Sudipto Guha, Samir Khuller : Greedy Strikes Back: Improved Facility Location Algorithms. J. Algorithms 31 (1): 228-248 (1999) Moses Charikar , Chandra Chekuri , To-Yat Cheung , Zuo Dai , Ashish Goel , Sudipto Guha, Ming Li : Approximation Algorithms for Directed Steiner Problems. J. Algorithms 33 (1): 73-91 (1999) Moses Charikar , Chandra Chekuri , Ashish Goel , Sudipto Guha, Serge A. Plotkin : Approximating a Finite Metric by a Small Number of Tree Metrics. FOCS 1998 : 379-388 Sudipto Guha, Samir Khuller : Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets. FSTTCS 1998 : 54-65 Sudipto Guha, Rajeev Rastogi , Kyuseok Shim : CURE: An Efficient Clustering Algorithm for Large Databases. SIGMOD Conference 1998 : 73-84 Moses Charikar , Chandra Chekuri , To-Yat Cheung , Zuo Dai , Ashish Goel , Sudipto Guha, Ming Li : Approximation Algorithms for Directed Steiner Problems. SODA 1998 : 192-200 Sudipto Guha, Samir Khuller : Greedy Strikes Back: Improved Facility Location Algorithms. SODA 1998 : 649-657 Moses Charikar , Chandra Chekuri , Ashish Goel , Sudipto Guha: Rounding via Trees: Deterministic Approximation Algorithms for Group Steiner Trees and k -Median. STOC 1998 : 114-123 Amotz Bar-Noy , Sudipto Guha, Joseph Naor , Baruch Schieber : Multicasting in Heterogeneous Networks. STOC 1998 : 448-453 Randeep Bhatia , Sudipto Guha, Samir Khuller , Yoram J. Sussmann : Facility Location with Dynamic Distance Function (Extended Abstract). SWAT 1998 : 23-34 Sudipto Guha, Samir Khuller : Approximation Algorithms for Connected Dominating Sets. Algorithmica 20 (4): 374-387 (1998) Randeep Bhatia , Sudipto Guha, Samir Khuller , Yoram J. Sussmann : Facility Location with Dynamic Distance Functions. J. Comb. Optim. 2 (3): 199-217 (1998) Sudipto Guha, Samir Khuller : Approximation Algorithms for Connected Dominating Sets. ESA 1996 : 179-193 1 [ 56 ] 2 [ 5 ] [ 15 ] [ 20 ] [ 26 ] [ 36 ] 3 [ 62 ] 4 [ 2 ] [ 4 ] 5 [ 6 ] [ 8 ] [ 11 ] [ 12 ] [ 17 ] [ 19 ] [ 32 ] [ 63 ] 6 [ 56 ] 7 [ 6 ] [ 8 ] [ 11 ] [ 12 ] [ 55 ] [ 68 ] 8 [ 8 ] [ 12 ] 9 [ 48 ] [ 60 ] [ 61 ] [ 64 ] 10 [ 8 ] [ 12 ] 11 [ 56 ] 12 [ 22 ] [ 31 ] 13 [ 33 ] [ 34 ] 14 [ 6 ] [ 8 ] [ 11 ] [ 12 ] 15 [ 51 ] [ 53 ] 16 [ 60 ] [ 64 ] 17 [ 67 ] [ 70 ] 18 [ 35 ] [ 46 ] 19 [ 33 ] [ 34 ] [ 39 ] [ 44 ] 20 [ 40 ] 21 [ 62 ] 22 [ 36 ] 23 [ 48 ] [ 60 ] [ 61 ] [ 64 ] 24 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 7 ] [ 10 ] [ 13 ] [ 14 ] [ 35 ] [ 46 ] 25 [ 59 ] 26 [ 60 ] [ 64 ] 27 [ 33 ] 28 [ 28 ] [ 39 ] [ 40 ] [ 41 ] [ 43 ] [ 51 ] [ 53 ] [ 54 ] [ 57 ] [ 71 ] 29 [ 64 ] 30 [ 52 ] 31 [ 8 ] [ 12 ] 32 [ 57 ] 33 [ 49 ] 34 [ 69 ] 35 [ 23 ] [ 29 ] [ 30 ] [ 42 ] [ 45 ] [ 47 ] 36 [ 24 ] [ 42 ] [ 47 ] 37 [ 16 ] 38 [ 24 ] [ 42 ] [ 47 ] 39 [ 23 ] [ 29 ] [ 30 ] [ 37 ] [ 38 ] [ 45 ] [ 52 ] 40 [ 33 ] [ 34 ] [ 44 ] 41 [ 5 ] [ 15 ] [ 16 ] [ 20 ] [ 26 ] [ 36 ] [ 48 ] [ 55 ] [ 60 ] [ 61 ] [ 64 ] [ 68 ] 42 [ 24 ] [ 42 ] [ 47 ] 43 [ 35 ] [ 46 ] 44 [ 11 ] 45 [ 9 ] [ 18 ] [ 21 ] [ 27 ] [ 50 ] 46 [ 5 ] [ 15 ] [ 16 ] [ 20 ] [ 22 ] [ 26 ] [ 31 ] [ 36 ] 47 [ 36 ] 48 [ 9 ] [ 18 ] [ 21 ] [ 27 ] [ 28 ] [ 50 ] [ 58 ] [ 59 ] [ 66 ] 49 [ 17 ] [ 32 ] 50 [ 40 ] [ 41 ] [ 51 ] [ 54 ] [ 57 ] [ 71 ] 51 [ 33 ] [ 34 ] [ 44 ] 52 [ 2 ] [ 4 ] 53 [ 17 ] [ 32 ] 54 [ 39 ] 55 [ 49 ] 56 [ 52 ] [ 69 ] 57 [ 51 ] 58 [ 58 ] 59 [ 56 ] 60 [ 40 ] [ 54 ] 61 [ 71 ]  ©2006 Association for Computing Machinery |
