Aravind Srinivasan

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 William I. Gasarch

> Home > Persons > Aravind Srinivasan

Publications

2015
[j66]
- view
  authority control:
- export record
  dblp key:
  - journals/toct/AmbainisGSU15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/toct/AmbainisGSU15
Andris Ambainis, William I. Gasarch, Aravind Srinivasan, Andrey Utis:
Lower Bounds on the Deterministic and Quantum Communication Complexity of Hamming-Distance Problems. ACM Trans. Comput. Theory 7(3): 10:1-10:10 (2015)
2006
[c57]
- view
  authority control:
- export record
  dblp key:
  - conf/isaac/AmbainisGSU06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/AmbainisGSU06
Andris Ambainis, William I. Gasarch, Aravind Srinivasan, Andrey Utis:
Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems. ISAAC 2006: 628-637
2004
[i4]
- view
  - electronic edition @ arxiv.org (open access)
  - details & citations
- export record
  dblp key:
  - journals/corr/cs-CC-0411076
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/cs-CC-0411076
Andris Ambainis, William I. Gasarch, Aravind Srinivasan, Andrey Utis:
Lower bounds on the Deterministic and Quantum Communication Complexity of Hamming Distance. CoRR cs.CC/0411076 (2004)
[i3]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - details & citations
- export record
  dblp key:
  - journals/eccc/ECCC-TR04-120
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/ECCC-TR04-120
Andris Ambainis, William I. Gasarch, Aravind Srinivasan, Andrey Utis:
Lower bounds on the Deterministic and Quantum Communication Complexity of HAM_n^a. Electron. Colloquium Comput. Complex. TR04 (2004)
2003
[j28]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/GasarchGS03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/GasarchGS03
William I. Gasarch, Evan Golub, Aravind Srinivasan:
When does a random Robin Hood win? Theor. Comput. Sci. 304(1-3): 477-484 (2003)

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.