BibTeX records: Frank Fussenegger

download as .bib file

@article{DBLP:journals/jacm/FusseneggerG79,
  author    = {Frank Fussenegger and
               Harold N. Gabow},
  title     = {A Counting Approach to Lower Bounds for Selection Problems},
  journal   = {J. {ACM}},
  volume    = {26},
  number    = {2},
  pages     = {227--238},
  year      = {1979},
  url       = {http://doi.acm.org/10.1145/322123.322128},
  doi       = {10.1145/322123.322128},
  timestamp = {Thu, 20 Nov 2003 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/jacm/FusseneggerG79},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/FusseneggerG76,
  author    = {Frank Fussenegger and
               Harold N. Gabow},
  title     = {Using Comparison Trees to Derive Lower Bounds for Selection Problems},
  booktitle = {17th Annual Symposium on Foundations of Computer Science, Houston,
               Texas, USA, 25-27 October 1976},
  pages     = {178--182},
  year      = {1976},
  crossref  = {DBLP:conf/focs/FOCS17},
  url       = {https://doi.org/10.1109/SFCS.1976.34},
  doi       = {10.1109/SFCS.1976.34},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/FusseneggerG76},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/FOCS17,
  title     = {17th Annual Symposium on Foundations of Computer Science, Houston,
               Texas, USA, 25-27 October 1976},
  publisher = {{IEEE} Computer Society},
  year      = {1976},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4567877},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/FOCS17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
maintained by Schloss Dagstuhl LZI at University of Trier