Ramesh Govindan

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Cyrus Shahabi

> Home > Persons > Ramesh Govindan

Publications

2005
[j31]
- view
  authority control:
- export record
  dblp key:
  - journals/sigbed/GummadiLGSH05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/sigbed/GummadiLGSH05
Ramakrishna Gummadi, Xin Li, Ramesh Govindan, Cyrus Shahabi, Wei Hong:
Energy-efficient data organization and query processing in sensor networks. SIGBED Rev. 2(1): 7-12 (2005)
[j30]
- view
  authority control:
- export record
  dblp key:
  - journals/sigmod/ShahabiGA05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/sigmod/ShahabiGA05
Cyrus Shahabi, Ramesh Govindan, Karl Aberer:
Report on the first IEEE international workshop on networking meets databases (NetDB'05). SIGMOD Rec. 34(4): 75-77 (2005)
[c52]
- view
  authority control:
- export record
  dblp key:
  - conf/icde/GummadiLGSH05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icde/GummadiLGSH05
Ramakrishna Gummadi, Xin Li, Ramesh Govindan, Cyrus Shahabi, Wei Hong:
Energy-efficient Data Organization and Query Processing in Sensor Networks. ICDE 2005: 157-158
2004
[c38]
- view
  authority control:
- export record
  dblp key:
  - conf/sensys/GummadiLGSH04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sensys/GummadiLGSH04
Ramakrishna Gummadi, Xin Li, Ramesh Govindan, Cyrus Shahabi, Wei Hong:
Energy-efficient data organization and query processing in sensor networks. SenSys 2004: 273-274

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.