Gauri Shah

ACM-SIAM Symposium on Discrete Algorithms · 2003

A researcher in the Science corpus: 1 paper; trusts 2 researchers and is trusted by 7 researchers here, as inferred from the citation graph.

Whom Gauri Shah trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

  1. William W. Pugh
  2. Donald Ervin Knuth

Who trusts Gauri Shah overall

  1. John Risson
  2. David R Karger
  3. Michael T. Goodrich
  4. Tim Moors
  5. M. Ruhl

Papers from Gauri Shah's perspective

Ordered by how strongly the researchers Gauri Shah trusts endorse each paper. Same corpus, a different order for every researcher.

  1. A scalable content-addressable network (Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication)
  2. Skip lists: a probabilistic alternative to balanced trees
  3. The art of computer programming: sorting and searching (volume 3)
  4. Tracking down software bugs using automatic anomaly detection (Proceedings of the 24th International Conference on Software Engineering. ICSE 2002)
  5. Application-Level Multicast Using Content-Addressable Networks (Networked Group Communication)
  6. Efficient and precise datarace detection for multithreaded object-oriented programs (ACM-SIGPLAN Symposium on Programming Language Design and Implementation)
  7. Extended static checking for Java (ACM-SIGPLAN Symposium on Programming Language Design and Implementation)
  8. A system and language for building system-specific, static analyses (ACM-SIGPLAN Symposium on Programming Language Design and Implementation)
  9. Flow-sensitive type qualifiers (ACM-SIGPLAN Symposium on Programming Language Design and Implementation)
  10. Checking system rules using system-specific, programmer-written compiler extensions (USENIX Symposium on Operating Systems Design and Implementation)

Their papers