Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Rahul Jain 0001

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 Hartmut Klauck

> Home > Persons > Rahul Jain 0001

Publications

2020
[j36]
- view
  authority control:
- export record
  dblp key:
  - journals/mst/JainKKLSSV20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/JainKKLSSV20
Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs:
Quadratically Tight Relations for Randomized Query Complexity. Theory Comput. Syst. 64(1): 101-119 (2020)
2018
[c34]
- view
  authority control:
- export record
  dblp key:
  - conf/csr/0001KKLSSV18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/csr/0001KKLSSV18
Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs:
Quadratically Tight Relations for Randomized Query Complexity. CSR 2018: 207-219
2017
[i44]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1708-00822
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1708-00822
Dmitry Gavinsky, Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs:
Quadratically Tight Relations for Randomized Query Complexity. CoRR abs/1708.00822 (2017)
[i41]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/GavinskyJKKLSSV17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/GavinskyJKKLSSV17
Dmitry Gavinsky, Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal, Jevgenijs Vihrovs:
Quadratically Tight Relations for Randomized Query Complexity. Electron. Colloquium Comput. Complex. TR17 (2017)
2010
[j10]
- view
  authority control:
- export record
  dblp key:
  - journals/ipl/JainKS10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/JainKS10
Rahul Jain, Hartmut Klauck, Miklos Santha:
Optimal direct sum results for deterministic and randomized decision tree complexity. Inf. Process. Lett. 110(20): 893-897 (2010)
[c16]
- view
  authority control:
- export record
  dblp key:
  - conf/coco/JainK10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/coco/JainK10
Rahul Jain, Hartmut Klauck:
The Partition Bound for Classical Communication Complexity and Query Complexity. CCC 2010: 247-258
[c15]
- view
  authority control:
- export record
  dblp key:
  - conf/cocoon/JainKZ10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoon/JainKZ10
Rahul Jain, Hartmut Klauck, Shengyu Zhang:
Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas. COCOON 2010: 54-59
[i15]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1004-0105
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1004-0105
Rahul Jain, Hartmut Klauck, Miklos Santha:
Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity. CoRR abs/1004.0105 (2010)
2009
[c11]
- view
  authority control:
- export record
  dblp key:
  - conf/coco/JainK09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/coco/JainK09
Rahul Jain, Hartmut Klauck:
New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques. CCC 2009: 369-378
[i10]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-0902-3056
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-0902-3056
Rahul Jain, Hartmut Klauck:
New Results in the Simultaneous Message Passing Model. CoRR abs/0902.3056 (2009)
[i8]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-0908-4453
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-0908-4453
Rahul Jain, Hartmut Klauck, Shengyu Zhang:
Depth-Independent Lower bounds on the Communication Complexity of Read-Once Boolean Formulas. CoRR abs/0908.4453 (2009)
[i7]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-0910-4266
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-0910-4266
Rahul Jain, Hartmut Klauck:
The Partition Bound for Classical Communication Complexity and Query Complexity. CoRR abs/0910.4266 (2009)
2008
[c9]
- view
  authority control:
- export record
  dblp key:
  - conf/stoc/JainKN08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/JainKN08
Rahul Jain, Hartmut Klauck, Ashwin Nayak:
Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract. STOC 2008: 599-608
2007
[i4]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/JainKN07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/JainKN07
Rahul Jain, Hartmut Klauck, Ashwin Nayak:
Direct Product Theorems for Communication Complexity via Subdistribution Bounds. Electron. Colloquium Comput. Complex. TR07 (2007)

a service of

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.