The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Gautam Das: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gautam Das, Heikki Mannila, Pirjo Ronkainen
    Similarity of Attributes by External Probes. [Citation Graph (2, 0)][DBLP]
    KDD, 1998, pp:23-29 [Conf]
  2. Béla Bollobás, Gautam Das, Dimitrios Gunopulos, Heikki Mannila
    Time-Series Similarity Problems and Well-Separated Geometric Sets. [Citation Graph (1, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:454-456 [Conf]
  3. Gautam Das, Rudolf Fleischer, Leszek Gasieniec, Dimitrios Gunopulos, Juha Kärkkäinen
    Episode Matching. [Citation Graph (1, 0)][DBLP]
    CPM, 1997, pp:12-27 [Conf]
  4. Gautam Das, Dimitrios Gunopulos, Heikki Mannila
    Finding Similar Time Series. [Citation Graph (1, 0)][DBLP]
    PKDD, 1997, pp:88-100 [Conf]
  5. Gautam Das, M. Fazio, Massimo Villari, Antonio Puliafito
    Vulnerabilities of Internet Access Mechanisms from Mobile Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    AINA (1), 2006, pp:851-858 [Conf]
  6. Gautam Das
    The visibility graph contains a bounded-degree spanner. [Citation Graph (0, 0)][DBLP]
    CCCG, 1997, pp:- [Conf]
  7. Gautam Das, Paul J. Heffernan, Giri Narasimhan
    LR-visibility in Polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:303-308 [Conf]
  8. Danny Z. Chen, Gautam Das, Michiel H. M. Smid
    Lower Bounds for Computing Geometric Spanners and Approximate Shortest Paths. [Citation Graph (0, 0)][DBLP]
    CCCG, 1996, pp:155-160 [Conf]
  9. Sanjay Agrawal, Surajit Chaudhuri, Gautam Das, Aristides Gionis
    Automated Ranking of Database Query Results. [Citation Graph (0, 0)][DBLP]
    CIDR, 2003, pp:- [Conf]
  10. Amit Anil Nanavati, Siva Gurumurthy, Gautam Das, Dipanjan Chakraborty, Koustuv Dasgupta, Sougata Mukherjea, Anupam Joshi
    On the structural properties of massive telecom call graphs: findings and implications. [Citation Graph (0, 0)][DBLP]
    CIKM, 2006, pp:435-444 [Conf]
  11. Barun Chandra, Gautam Das, Giri Narasimhan, José Soares
    New Sparseness Results on Graph Spanners. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:192-201 [Conf]
  12. Gautam Das, Paul J. Heffernan, Giri Narasimhan
    Optimally Sparse Spanners in 3-Dimensional Euclidean Space. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:53-62 [Conf]
  13. Gautam Das, Giri Narasimhan
    A Fast Algorithm for Constructing Sparse Euclidean Spanners. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:132-139 [Conf]
  14. Gautam Das, Giri Narasimhan
    Optimal Linear-Time Algorithm for the Shortest Illuminating Line Segment in a Polygon. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:259-266 [Conf]
  15. Srinivasa Rao Arikati, Danny Z. Chen, L. Paul Chew, Gautam Das, Michiel H. M. Smid, Christos D. Zaroliagis
    Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:514-528 [Conf]
  16. Gautam Das, Sanjiv Kapoor, Michiel H. M. Smid
    On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1996, pp:64-75 [Conf]
  17. Sanjay Agrawal, Surajit Chaudhuri, Gautam Das
    DBXplorer: A System for Keyword-Based Search over Relational Databases. [Citation Graph (0, 0)][DBLP]
    ICDE, 2002, pp:5-16 [Conf]
  18. Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Vana Kalogeraki
    Approximating Aggregation Queries in Peer-to-Peer Networks. [Citation Graph (0, 0)][DBLP]
    ICDE, 2006, pp:42- [Conf]
  19. Surajit Chaudhuri, Gautam Das, Mayur Datar, Rajeev Motwani, Vivek R. Narasayya
    Overcoming Limitations of Sampling for Aggregation Queries. [Citation Graph (0, 0)][DBLP]
    ICDE, 2001, pp:534-542 [Conf]
  20. Foto N. Afrati, Gautam Das, Aristides Gionis, Heikki Mannila, Taneli Mielikäinen, Panayiotis Tsaparas
    Mining Chains of Relations. [Citation Graph (0, 0)][DBLP]
    ICDM, 2005, pp:553-556 [Conf]
  21. Gautam Das, Paul J. Heffernan
    Constructing Degree-3 Spanners with Other Sparseness Properties. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:11-20 [Conf]
  22. Gautam Das, King-Ip Lin, Heikki Mannila, Gopal Renganathan, Padhraic Smyth
    Rule Discovery from Time Series. [Citation Graph (0, 0)][DBLP]
    KDD, 1998, pp:16-22 [Conf]
  23. Michail Vlachos, Dimitrios Gunopulos, Gautam Das
    Rotation invariant distance measures for trajectories. [Citation Graph (0, 0)][DBLP]
    KDD, 2004, pp:707-712 [Conf]
  24. Gautam Das, Deborah Joseph
    Which Triangulations Approximate the Complete Graph?. [Citation Graph (0, 0)][DBLP]
    Optimal Algorithms, 1989, pp:168-192 [Conf]
  25. Gautam Das, Heikki Mannila
    Context-Based Similarity Measures for Categorical Databases. [Citation Graph (0, 0)][DBLP]
    PKDD, 2000, pp:201-210 [Conf]
  26. Pauli Miettinen, Taneli Mielikäinen, Aristides Gionis, Gautam Das, Heikki Mannila
    The Discrete Basis Problem. [Citation Graph (0, 0)][DBLP]
    PKDD, 2006, pp:335-346 [Conf]
  27. Gautam Das
    Approximate Query Processing. [Citation Graph (0, 0)][DBLP]
    SBBD, 2005, pp:8-9 [Conf]
  28. Brian Babcock, Surajit Chaudhuri, Gautam Das
    Dynamic Sample Selection for Approximate Query Processing. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2003, pp:539-550 [Conf]
  29. Sanjay Agrawal, Surajit Chaudhuri, Gautam Das
    DBXplorer: enabling keyword search over relational databases. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2002, pp:627- [Conf]
  30. Surajit Chaudhuri, Gautam Das, Vivek R. Narasayya
    A Robust, Optimization-Based Approach for Approximate Answering of Aggregate Queries. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2001, pp:295-306 [Conf]
  31. Surajit Chaudhuri, Gautam Das, Utkarsh Srivastava
    Effective Use of Block-Level Sampling in Statistics Estimation. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2004, pp:287-298 [Conf]
  32. Gautam Das, Vagelis Hristidis, Nishant Kapoor, S. Sudarshan
    Ordering the attributes of query results. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2006, pp:395-406 [Conf]
  33. Dimitrios Gunopulos, Gautam Das
    Time Series Similarity Measures and Time Series Indexing. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2001, pp:624- [Conf]
  34. Gautam Das, Giri Narasimhan, Jeffrey S. Salowe
    A New Way to Weigh Malnourished Euclidean Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:215-222 [Conf]
  35. Gautam Das, Deborah Joseph
    Minimum Vertex Hulls for Polyhedral Domains. [Citation Graph (0, 0)][DBLP]
    STACS, 1990, pp:126-137 [Conf]
  36. Sunil Arya, Gautam Das, David M. Mount, Jeffrey S. Salowe, Michiel H. M. Smid
    Euclidean spanners: short, thin, and lanky. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:489-498 [Conf]
  37. Gautam Das, Paul J. Heffernan, Giri Narasimhan
    Finding All Weakly-Visible Chords of a Polygon in Linear Time (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SWAT, 1994, pp:119-130 [Conf]
  38. Ingo Althöfer, Gautam Das, David P. Dobkin, Deborah Joseph
    Generating Sparse Spanners for Weighted Graphs. [Citation Graph (0, 0)][DBLP]
    SWAT, 1990, pp:26-37 [Conf]
  39. Surajit Chaudhuri, Gautam Das, Vagelis Hristidis, Gerhard Weikum
    Probabilistic Ranking of Database Query Results. [Citation Graph (0, 0)][DBLP]
    VLDB, 2004, pp:888-899 [Conf]
  40. Gautam Das, Dimitrios Gunopulos, Nick Koudas, Dimitris Tsirogiannis
    Answering Top-k Queries Using Views. [Citation Graph (0, 0)][DBLP]
    VLDB, 2006, pp:451-462 [Conf]
  41. Gautam Das, Michael T. Goodrich
    On the Complexity of Approximating and Illuminating Three-Dimensional Convex Polyhedra (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:74-85 [Conf]
  42. Gautam Das, Giri Narasimhan
    Geometric Searching and Link Distance (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:261-272 [Conf]
  43. Gautam Das, M. Fazio, Massimo Villari, Antonio Puliafito
    CCID: Core construction for information dissemination in ad hoc scenario. [Citation Graph (0, 0)][DBLP]
    Communications and Computer Networks, 2005, pp:114-119 [Conf]
  44. Gautam Das, M. Fazio, Massimo Villari, Antonio Puliafito
    Distributed core assisted scalable data dissemination in mobile ad hoc networks. [Citation Graph (0, 0)][DBLP]
    CollaborateCom, 2005, pp:- [Conf]
  45. Gautam Das, Sanjiv Kapoor, Michiel H. M. Smid
    On the Complexity of Approximating Euclidean Traveling Salesman Tours and Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:19, n:4, pp:447-460 [Journal]
  46. Yi-Min Wang, Lili Qiu, Chad Verbowski, Dimitris Achlioptas, Gautam Das, Per-Åke Larson
    Summary-based routing for content-based event distribution networks. [Citation Graph (0, 0)][DBLP]
    Computer Communication Review, 2004, v:34, n:5, pp:59-74 [Journal]
  47. Binay K. Bhattacharya, Gautam Das, Asish Mukhopadhyay, Giri Narasimhan
    Optimally computing a shortest weakly visible line segment inside a simple polygon. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2002, v:23, n:1, pp:1-29 [Journal]
  48. Gautam Das, Michael T. Goodrich
    On the Complexity of Optimization Problems for 3-dimensional Convex Polyhedra and Decision Trees. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:123-137 [Journal]
  49. Gautam Das, Paul J. Heffernan, Giri Narasimhan
    LR-visibility in Polygons. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:7, n:, pp:37-57 [Journal]
  50. Danny Z. Chen, Gautam Das, Michiel H. M. Smid
    Lower bounds for computing geometric spanners and approximate shortest paths. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:110, n:2-3, pp:151-167 [Journal]
  51. Ingo Althöfer, Gautam Das, David P. Dobkin, Deborah Joseph, José Soares
    On Sparse Spanners of Weighted Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:9, n:, pp:81-100 [Journal]
  52. Barun Chandra, Gautam Das, Giri Narasimhan, José Soares
    New sparseness results on graph spanners. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1995, v:5, n:, pp:125-144 [Journal]
  53. Gautam Das, Giri Narasimhan
    A Fast Algorithm for Constructing Sparse Euclidean Spanners. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1997, v:7, n:4, pp:297-315 [Journal]
  54. Gautam Das, Paul J. Heffernan
    Constructing Degree-3 Spanners with Other Sparseness Properties. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1996, v:7, n:2, pp:121-136 [Journal]
  55. Gautam Das, Michiel H. M. Smid
    A lower bound for approximating the geometric minimum weight matching. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:74, n:5-6, pp:253-255 [Journal]
  56. Béla Bollobás, Gautam Das, Dimitrios Gunopulos, Heikki Mannila
    Time-Series Similarity Problems and Well-Separated Geometric Sets. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2001, v:8, n:4, pp:409-423 [Journal]
  57. Gautam Das, Paul J. Heffernan, Giri Narasimhan
    Finding all Weakly-Visible Chords of a Polygon in Linear Time. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1994, v:1, n:4, pp:433-457 [Journal]
  58. Gautam Das, Deborah Joseph
    Minimum Vertex Hulls for Polyhedral Domains. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:103, n:1, pp:107-135 [Journal]
  59. Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Vana Kalogeraki
    Efficient Approximate Query Processing in Peer-to-Peer Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Knowl. Data Eng., 2007, v:19, n:7, pp:919-933 [Journal]
  60. Surajit Chaudhuri, Gautam Das, Vagelis Hristidis, Gerhard Weikum
    Probabilistic information retrieval approach for ranking of database query results. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Database Syst., 2006, v:31, n:3, pp:1134-1168 [Journal]
  61. Leonidas Fegaras, Weimin He, Gautam Das, David Levine
    XML Query Routing in Structured P2P Systems. [Citation Graph (0, 0)][DBLP]
    DBISP2P, 2006, pp:273-284 [Conf]
  62. Nishant Kapoor, Gautam Das, Vagelis Hristidis, S. Sudarshan, Gerhard Weikum
    STAR: A System for Tuple and Attribute Ranking of Query Answers. [Citation Graph (0, 0)][DBLP]
    ICDE, 2007, pp:1483-1484 [Conf]
  63. Girish Chafle, Gautam Das, Koustuv Dasgupta, Arun Kumar, Sumit Mittal, Sougata Mukherjea, Biplav Srivastava
    An Integrated Development Environment for Web Service Composition. [Citation Graph (0, 0)][DBLP]
    ICWS, 2007, pp:839-847 [Conf]
  64. Arjun Dasgupta, Gautam Das, Heikki Mannila
    A random walk approach to sampling hidden databases. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2007, pp:629-640 [Conf]
  65. Gautam Das, Dimitrios Gunopulos, Nick Koudas, Nikos Sarkas
    Ad-hoc Top-k Query Answering for Data Streams. [Citation Graph (0, 0)][DBLP]
    VLDB, 2007, pp:183-194 [Conf]
  66. Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Nick Koudas
    Anytime Measures for Top-k Algorithms. [Citation Graph (0, 0)][DBLP]
    VLDB, 2007, pp:914-925 [Conf]
  67. Senjuti Basu Roy, Gautam Das, Sajal Das
    Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:577-588 [Conf]
  68. Surajit Chaudhuri, Gautam Das, Vivek R. Narasayya
    Optimized stratified sampling for approximate query processing. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Database Syst., 2007, v:32, n:2, pp:9- [Journal]

  69. Minimum-effort driven dynamic faceted search in structured databases. [Citation Graph (, )][DBLP]


  70. Efficient sampling of information in social networks. [Citation Graph (, )][DBLP]


  71. TRANS: Top-k Implementation Techniques of Minimum Effort Driven Faceted Search For Databases. [Citation Graph (, )][DBLP]


  72. Top-k Algorithms and Applications. [Citation Graph (, )][DBLP]


  73. Ranking objects based on relationships and fixed associations. [Citation Graph (, )][DBLP]


  74. Turbo-charging hidden database samplers with overflowing queries and skew reduction. [Citation Graph (, )][DBLP]


  75. Algorithm-safe privacy-preserving data publishing. [Citation Graph (, )][DBLP]


  76. Standing Out in a Crowd: Selecting Attributes for Maximum Visibility. [Citation Graph (, )][DBLP]


  77. Region Sampling: Continuous Adaptive Sampling on Sensor Networks. [Citation Graph (, )][DBLP]


  78. DynaCet: Building Dynamic Faceted Search Systems over Databases. [Citation Graph (, )][DBLP]


  79. Leveraging COUNT Information in Sampling Hidden Databases. [Citation Graph (, )][DBLP]


  80. Versatile publishing for privacy preservation. [Citation Graph (, )][DBLP]


  81. Categorical skylines for streaming data. [Citation Graph (, )][DBLP]


  82. Privacy preservation of aggregates in hidden databases: why and how? [Citation Graph (, )][DBLP]


  83. HDSampler: revealing data behind web form interfaces. [Citation Graph (, )][DBLP]


  84. Constructing and exploring composite items. [Citation Graph (, )][DBLP]


  85. Call to order: a hierarchical browsing approach to eliciting users' preference. [Citation Graph (, )][DBLP]


  86. Unbiased estimation of size and other aggregates over hidden web databases. [Citation Graph (, )][DBLP]


  87. Facetedpedia: dynamic generation of query-dependent faceted interfaces for wikipedia. [Citation Graph (, )][DBLP]


  88. Distinct value estimation on peer-to-peer networks. [Citation Graph (, )][DBLP]


  89. Privacy risks in health databases from aggregate disclosure. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 2.156secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002