Search dblp for Publications

export results for "toc:db/journals/iandc/iandc95.bht:"

 download as .bib file

@article{DBLP:journals/iandc/ApostolicoC91,
  author       = {Alberto Apostolico and
                  Maxime Crochemore},
  title        = {Optimal Canonization of All Substrings of a String},
  journal      = {Inf. Comput.},
  volume       = {95},
  number       = {1},
  pages        = {76--95},
  year         = {1991},
  url          = {https://doi.org/10.1016/0890-5401(91)90016-U},
  doi          = {10.1016/0890-5401(91)90016-U},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/ApostolicoC91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/Bar-NoyDKP91,
  author       = {Amotz Bar{-}Noy and
                  Danny Dolev and
                  Daphne Koller and
                  David Peleg},
  title        = {Fault-Tolerant Critical Section Management in Asynchronous Environments},
  journal      = {Inf. Comput.},
  volume       = {95},
  number       = {1},
  pages        = {1--20},
  year         = {1991},
  url          = {https://doi.org/10.1016/0890-5401(91)90014-S},
  doi          = {10.1016/0890-5401(91)90014-S},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/Bar-NoyDKP91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/BarringtonM91,
  author       = {David A. Mix Barrington and
                  Pierre McKenzie},
  title        = {Oracle branching programs and Logspace versus {P}},
  journal      = {Inf. Comput.},
  volume       = {95},
  number       = {1},
  pages        = {96--115},
  year         = {1991},
  url          = {https://doi.org/10.1016/0890-5401(91)90017-V},
  doi          = {10.1016/0890-5401(91)90017-V},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/BarringtonM91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/Colussi91,
  author       = {Livio Colussi},
  title        = {Correctness and Efficiency of the Pattern Matching Algorithms},
  journal      = {Inf. Comput.},
  volume       = {95},
  number       = {2},
  pages        = {225--251},
  year         = {1991},
  url          = {https://doi.org/10.1016/0890-5401(91)90046-5},
  doi          = {10.1016/0890-5401(91)90046-5},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/Colussi91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/Engelfriet91,
  author       = {Joost Engelfriet},
  title        = {Iterated Stack Automata and Complexity Classes},
  journal      = {Inf. Comput.},
  volume       = {95},
  number       = {1},
  pages        = {21--75},
  year         = {1991},
  url          = {https://doi.org/10.1016/0890-5401(91)90015-T},
  doi          = {10.1016/0890-5401(91)90015-T},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/Engelfriet91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/HausslerKLW91,
  author       = {David Haussler and
                  Michael J. Kearns and
                  Nick Littlestone and
                  Manfred K. Warmuth},
  title        = {Equivalence of Models for Polynomial Learnability},
  journal      = {Inf. Comput.},
  volume       = {95},
  number       = {2},
  pages        = {129--161},
  year         = {1991},
  url          = {https://doi.org/10.1016/0890-5401(91)90042-Z},
  doi          = {10.1016/0890-5401(91)90042-Z},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/HausslerKLW91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/Hromkovic91,
  author       = {Juraj Hromkovic},
  title        = {Nonlinear Lower Bounds on the Number of Processors of Circuits with
                  Sublinear Separators},
  journal      = {Inf. Comput.},
  volume       = {95},
  number       = {2},
  pages        = {117--128},
  year         = {1991},
  url          = {https://doi.org/10.1016/0890-5401(91)90041-Y},
  doi          = {10.1016/0890-5401(91)90041-Y},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/Hromkovic91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/JainS91,
  author       = {Sanjay Jain and
                  Arun Sharma},
  title        = {Learning in the Presence of Partial Explanations},
  journal      = {Inf. Comput.},
  volume       = {95},
  number       = {2},
  pages        = {162--191},
  year         = {1991},
  url          = {https://doi.org/10.1016/0890-5401(91)90043-2},
  doi          = {10.1016/0890-5401(91)90043-2},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/JainS91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/MaheshPS91,
  author       = {R. Mahesh and
                  C. Pandu Rangan and
                  Aravind Srinivasan},
  title        = {On Finding the Minimum Bandwidth of Interval Graphs},
  journal      = {Inf. Comput.},
  volume       = {95},
  number       = {2},
  pages        = {218--224},
  year         = {1991},
  url          = {https://doi.org/10.1016/0890-5401(91)90045-4},
  doi          = {10.1016/0890-5401(91)90045-4},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/MaheshPS91.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/Ponse91,
  author       = {Alban Ponse},
  title        = {Process Expressions and Hoare's Logic: Showing an Irreconcilability
                  of Context-Free Recursion with Scott's Induction Rule},
  journal      = {Inf. Comput.},
  volume       = {95},
  number       = {2},
  pages        = {192--217},
  year         = {1991},
  url          = {https://doi.org/10.1016/0890-5401(91)90044-3},
  doi          = {10.1016/0890-5401(91)90044-3},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/Ponse91.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.