BibTeX record conf/focs/AjtaiF88

download as .bib file

@inproceedings{DBLP:conf/focs/AjtaiF88,
  author       = {Mikl{\'{o}}s Ajtai and
                  Ronald Fagin},
  title        = {Reachability Is Harder for Directed than for Undirected Finite Graphs
                  (Preliminary Version)},
  booktitle    = {29th Annual Symposium on Foundations of Computer Science, White Plains,
                  New York, USA, 24-26 October 1988},
  pages        = {358--367},
  publisher    = {{IEEE} Computer Society},
  year         = {1988},
  url          = {https://doi.org/10.1109/SFCS.1988.21952},
  doi          = {10.1109/SFCS.1988.21952},
  timestamp    = {Thu, 23 Mar 2023 23:57:54 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/AjtaiF88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics