Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/iandc/AfratiPP89,
  author       = {Foto N. Afrati and
                  Christos H. Papadimitriou and
                  George Papageorgiou},
  title        = {Corrigendum: The Complexity of Cubical Graphs},
  journal      = {Inf. Comput.},
  volume       = {82},
  number       = {3},
  pages        = {350--353},
  year         = {1989},
  url          = {https://doi.org/10.1016/0890-5401(89)90006-0},
  doi          = {10.1016/0890-5401(89)90006-0},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/AfratiPP89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/AndersonMW89,
  author       = {Richard J. Anderson and
                  Ernst W. Mayr and
                  Manfred K. Warmuth},
  title        = {Parallel Approximation Algorithms for Bin Packing},
  journal      = {Inf. Comput.},
  volume       = {82},
  number       = {3},
  pages        = {262--277},
  year         = {1989},
  url          = {https://doi.org/10.1016/0890-5401(89)90003-5},
  doi          = {10.1016/0890-5401(89)90003-5},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/AndersonMW89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/AndreD89,
  author       = {Andr{\'{e}} Arnold and
                  Anne Dicky},
  title        = {An Algebraic Characterization of Transition System Equivalences},
  journal      = {Inf. Comput.},
  volume       = {82},
  number       = {2},
  pages        = {198--229},
  year         = {1989},
  url          = {https://doi.org/10.1016/0890-5401(89)90054-0},
  doi          = {10.1016/0890-5401(89)90054-0},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/AndreD89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/BertoniMS89,
  author       = {Alberto Bertoni and
                  Giancarlo Mauri and
                  Nicoletta Sabadini},
  title        = {Membership Problems for Regular and Context-Free Trace Languages},
  journal      = {Inf. Comput.},
  volume       = {82},
  number       = {2},
  pages        = {135--150},
  year         = {1989},
  url          = {https://doi.org/10.1016/0890-5401(89)90051-5},
  doi          = {10.1016/0890-5401(89)90051-5},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/BertoniMS89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/CaiH89,
  author       = {Jin{-}yi Cai and
                  Lane A. Hemachandra},
  title        = {Enumerative Counting Is Hard},
  journal      = {Inf. Comput.},
  volume       = {82},
  number       = {1},
  pages        = {34--44},
  year         = {1989},
  url          = {https://doi.org/10.1016/0890-5401(89)90063-1},
  doi          = {10.1016/0890-5401(89)90063-1},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/CaiH89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/Droste89,
  author       = {Manfred Droste},
  title        = {Recursive Domain Equations for Concrete Data Structures},
  journal      = {Inf. Comput.},
  volume       = {82},
  number       = {1},
  pages        = {65--80},
  year         = {1989},
  url          = {https://doi.org/10.1016/0890-5401(89)90065-5},
  doi          = {10.1016/0890-5401(89)90065-5},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/Droste89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/EhrenfeuchtH89,
  author       = {Andrzej Ehrenfeucht and
                  David Haussler},
  title        = {Learning Decision Trees from Random Examples},
  journal      = {Inf. Comput.},
  volume       = {82},
  number       = {3},
  pages        = {231--246},
  year         = {1989},
  url          = {https://doi.org/10.1016/0890-5401(89)90001-1},
  doi          = {10.1016/0890-5401(89)90001-1},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/EhrenfeuchtH89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/EhrenfeuchtHKV89,
  author       = {Andrzej Ehrenfeucht and
                  David Haussler and
                  Michael J. Kearns and
                  Leslie G. Valiant},
  title        = {A General Lower Bound on the Number of Examples Needed for Learning},
  journal      = {Inf. Comput.},
  volume       = {82},
  number       = {3},
  pages        = {247--261},
  year         = {1989},
  url          = {https://doi.org/10.1016/0890-5401(89)90002-3},
  doi          = {10.1016/0890-5401(89)90002-3},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/EhrenfeuchtHKV89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/FreivaldsSV89,
  author       = {Rusins Freivalds and
                  Carl H. Smith and
                  Mahendran Velauthapillai},
  title        = {Trade-Off among Parameters Effecting Inductive Inference},
  journal      = {Inf. Comput.},
  volume       = {82},
  number       = {3},
  pages        = {323--349},
  year         = {1989},
  url          = {https://doi.org/10.1016/0890-5401(89)90005-9},
  doi          = {10.1016/0890-5401(89)90005-9},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/FreivaldsSV89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/JouannaudK89,
  author       = {Jean{-}Pierre Jouannaud and
                  Emmanuel Kounalis},
  title        = {Automatic Proofs by Induction in Theories without Constructors},
  journal      = {Inf. Comput.},
  volume       = {82},
  number       = {1},
  pages        = {1--33},
  year         = {1989},
  url          = {https://doi.org/10.1016/0890-5401(89)90062-X},
  doi          = {10.1016/0890-5401(89)90062-X},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/JouannaudK89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/LynchS89,
  author       = {Nancy A. Lynch and
                  Eugene W. Stark},
  title        = {A Proof of the Kahn Principle for Input/Output Automata},
  journal      = {Inf. Comput.},
  volume       = {82},
  number       = {1},
  pages        = {81--92},
  year         = {1989},
  url          = {https://doi.org/10.1016/0890-5401(89)90066-7},
  doi          = {10.1016/0890-5401(89)90066-7},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/LynchS89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/MontenyohlW89,
  author       = {Margaret Montenyohl and
                  Mitchell Wand},
  title        = {Incorporating Static Analysis in a Combinator-Based Compiler},
  journal      = {Inf. Comput.},
  volume       = {82},
  number       = {2},
  pages        = {151--184},
  year         = {1989},
  url          = {https://doi.org/10.1016/0890-5401(89)90052-7},
  doi          = {10.1016/0890-5401(89)90052-7},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/MontenyohlW89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/MoranB89,
  author       = {L{\'{a}}szl{\'{o}} Babai and
                  Shlomo Moran},
  title        = {Proving Properties of Interactive Proofs by a Generalized Counting
                  Technique},
  journal      = {Inf. Comput.},
  volume       = {82},
  number       = {2},
  pages        = {185--197},
  year         = {1989},
  url          = {https://doi.org/10.1016/0890-5401(89)90053-9},
  doi          = {10.1016/0890-5401(89)90053-9},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iandc/MoranB89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/SinclairJ89,
  author       = {Alistair Sinclair and
                  Mark Jerrum},
  title        = {Approximate Counting, Uniform Generation and Rapidly Mixing Markov
                  Chains},
  journal      = {Inf. Comput.},
  volume       = {82},
  number       = {1},
  pages        = {93--133},
  year         = {1989},
  url          = {https://doi.org/10.1016/0890-5401(89)90067-9},
  doi          = {10.1016/0890-5401(89)90067-9},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/SinclairJ89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/StompRG89,
  author       = {Frank A. Stomp and
                  Willem P. de Roever and
                  Rob Gerth},
  title        = {The upsilon-Calculus as an Assertion-Language for Fairness Arguments},
  journal      = {Inf. Comput.},
  volume       = {82},
  number       = {3},
  pages        = {278--322},
  year         = {1989},
  url          = {https://doi.org/10.1016/0890-5401(89)90004-7},
  doi          = {10.1016/0890-5401(89)90004-7},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/StompRG89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/Willard89,
  author       = {Dan E. Willard},
  title        = {Lower Bounds for the Addition-Subtraction Operations in Orthogonal
                  Range Queries and Related Problems},
  journal      = {Inf. Comput.},
  volume       = {82},
  number       = {1},
  pages        = {45--64},
  year         = {1989},
  url          = {https://doi.org/10.1016/0890-5401(89)90064-3},
  doi          = {10.1016/0890-5401(89)90064-3},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/Willard89.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.