BibTeX record conf/isaac/ArvindSV99

download as .bib file

@inproceedings{DBLP:conf/isaac/ArvindSV99,
  author       = {Vikraman Arvind and
                  K. V. Subrahmanyam and
                  N. V. Vinodchandran},
  editor       = {Alok Aggarwal and
                  C. Pandu Rangan},
  title        = {The Query Complexity of Program Checking by Constant-Depth Circuits},
  booktitle    = {Algorithms and Computation, 10th International Symposium, {ISAAC}
                  '99, Chennai, India, December 16-18, 1999, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {1741},
  pages        = {123--132},
  publisher    = {Springer},
  year         = {1999},
  url          = {https://doi.org/10.1007/3-540-46632-0\_13},
  doi          = {10.1007/3-540-46632-0\_13},
  timestamp    = {Mon, 01 May 2023 13:01:33 +0200},
  biburl       = {https://dblp.org/rec/conf/isaac/ArvindSV99.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.