dblp.uni-trier.dewww.uni-trier.de

DBLP Record 'conf/stoc/AnderssonHP95'

BibTeX

@inproceedings{DBLP:conf/stoc/AnderssonHP95,
  author    = {Arne Andersson and
               Johan H{\aa}stad and
               Ola Petersson},
  title     = {A tight lower bound for searching a sorted array},
  booktitle = {STOC},
  year      = {1995},
  pages     = {417-426},
  ee        = {http://doi.acm.org/10.1145/225058.225171},
  crossref  = {DBLP:conf/stoc/STOC27},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/stoc/STOC27,
  title     = {Proceedings of the Twenty-Seventh Annual ACM Symposium on
               Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada,
               USA},
  booktitle = {STOC},
  publisher = {ACM},
  year      = {1995},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Copyright © 2002-12-18 by Michael Ley (ley@uni-trier.de)