Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/iandc/AllenderW90,
  author       = {Eric Allender and
                  Osamu Watanabe},
  title        = {Kolmogorov Complexity and Degrees of Tally Sets},
  journal      = {Inf. Comput.},
  volume       = {86},
  number       = {2},
  pages        = {160--178},
  year         = {1990},
  url          = {https://doi.org/10.1016/0890-5401(90)90052-J},
  doi          = {10.1016/0890-5401(90)90052-J},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/AllenderW90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/AshHP90,
  author       = {Christopher J. Ash and
                  Thomas Eric Hall and
                  Jean{-}Eric Pin},
  title        = {On the Varieties of Languages Associated with Some Varieties of Finite
                  Monoids with Commuting Idempotents},
  journal      = {Inf. Comput.},
  volume       = {86},
  number       = {1},
  pages        = {32--42},
  year         = {1990},
  url          = {https://doi.org/10.1016/0890-5401(90)90024-C},
  doi          = {10.1016/0890-5401(90)90024-C},
  timestamp    = {Sun, 28 Jul 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iandc/AshHP90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/Asperti90,
  author       = {Andrea Asperti},
  title        = {Stability and Computability in Coherent Domains},
  journal      = {Inf. Comput.},
  volume       = {86},
  number       = {2},
  pages        = {115--139},
  year         = {1990},
  url          = {https://doi.org/10.1016/0890-5401(90)90050-R},
  doi          = {10.1016/0890-5401(90)90050-R},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/Asperti90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/Bodlaender90,
  author       = {Hans L. Bodlaender},
  title        = {The Complexity of Finding Uniform Emulations on Paths and Ring Networks},
  journal      = {Inf. Comput.},
  volume       = {86},
  number       = {1},
  pages        = {87--106},
  year         = {1990},
  url          = {https://doi.org/10.1016/0890-5401(90)90027-F},
  doi          = {10.1016/0890-5401(90)90027-F},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/Bodlaender90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/ChangFD90,
  author       = {Chein{-}I Chang and
                  Simon C. Fan and
                  Lee D. Davisson},
  title        = {On Numerical Methods of Calculating the Capacity of Continuous-Input
                  Discrete-Output Memoryless Channels},
  journal      = {Inf. Comput.},
  volume       = {86},
  number       = {1},
  pages        = {1--13},
  year         = {1990},
  url          = {https://doi.org/10.1016/0890-5401(90)90022-A},
  doi          = {10.1016/0890-5401(90)90022-A},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/ChangFD90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/Frederickson90,
  author       = {Greg N. Frederickson},
  title        = {A Distributed Shortest Path Algorithm for a Planar Network},
  journal      = {Inf. Comput.},
  volume       = {86},
  number       = {2},
  pages        = {140--159},
  year         = {1990},
  url          = {https://doi.org/10.1016/0890-5401(90)90051-I},
  doi          = {10.1016/0890-5401(90)90051-I},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/Frederickson90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/FulopV90,
  author       = {Zolt{\'{a}}n F{\"{u}}l{\"{o}}p and
                  S{\'{a}}ndor V{\'{a}}gv{\"{o}}lgyi},
  title        = {A Complete Rewriting System for a Monoid of Tree Transformation Classes},
  journal      = {Inf. Comput.},
  volume       = {86},
  number       = {2},
  pages        = {195--212},
  year         = {1990},
  url          = {https://doi.org/10.1016/0890-5401(90)90054-L},
  doi          = {10.1016/0890-5401(90)90054-L},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/FulopV90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/GoldstineKW90,
  author       = {Jonathan Goldstine and
                  Chandra M. R. Kintala and
                  Detlef Wotschke},
  title        = {On Measuring Nondeterminism in Regular Languages},
  journal      = {Inf. Comput.},
  volume       = {86},
  number       = {2},
  pages        = {179--194},
  year         = {1990},
  url          = {https://doi.org/10.1016/0890-5401(90)90053-K},
  doi          = {10.1016/0890-5401(90)90053-K},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/GoldstineKW90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/KanellakisS90,
  author       = {Paris C. Kanellakis and
                  Scott A. Smolka},
  title        = {{CCS} Expressions, Finite State Processes, and Three Problems of Equivalence},
  journal      = {Inf. Comput.},
  volume       = {86},
  number       = {1},
  pages        = {43--68},
  year         = {1990},
  url          = {https://doi.org/10.1016/0890-5401(90)90025-D},
  doi          = {10.1016/0890-5401(90)90025-D},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/KanellakisS90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/KapurNO90,
  author       = {Deepak Kapur and
                  Paliath Narendran and
                  Friedrich Otto},
  title        = {On Ground-Confluence of Term Rewriting Systems},
  journal      = {Inf. Comput.},
  volume       = {86},
  number       = {1},
  pages        = {14--31},
  year         = {1990},
  url          = {https://doi.org/10.1016/0890-5401(90)90023-B},
  doi          = {10.1016/0890-5401(90)90023-B},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/KapurNO90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/Litow90,
  author       = {Bruce E. Litow},
  title        = {Parallel Complexity of the Regular Code Problem},
  journal      = {Inf. Comput.},
  volume       = {86},
  number       = {1},
  pages        = {107--114},
  year         = {1990},
  url          = {https://doi.org/10.1016/0890-5401(90)90028-G},
  doi          = {10.1016/0890-5401(90)90028-G},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/Litow90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/StrothotteS90,
  author       = {J{\"{o}}rg{-}R{\"{u}}diger Sack and
                  Thomas Strothotte},
  title        = {A Characterization of Heaps and Its Applications},
  journal      = {Inf. Comput.},
  volume       = {86},
  number       = {1},
  pages        = {69--86},
  year         = {1990},
  url          = {https://doi.org/10.1016/0890-5401(90)90026-E},
  doi          = {10.1016/0890-5401(90)90026-E},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/StrothotteS90.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

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.