Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/iandc/BatuRW05,
  author       = {Tugkan Batu and
                  Ronitt Rubinfeld and
                  Patrick White},
  title        = {Fast approximate PCPs for multidimensional bin-packing problems},
  journal      = {Inf. Comput.},
  volume       = {196},
  number       = {1},
  pages        = {42--56},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ic.2004.10.001},
  doi          = {10.1016/J.IC.2004.10.001},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/BatuRW05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/CardelliGG05,
  author       = {Luca Cardelli and
                  Giorgio Ghelli and
                  Andrew D. Gordon},
  title        = {Secrecy and group creation},
  journal      = {Inf. Comput.},
  volume       = {196},
  number       = {2},
  pages        = {127--155},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ic.2004.08.003},
  doi          = {10.1016/J.IC.2004.08.003},
  timestamp    = {Mon, 14 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/CardelliGG05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/DurandM05,
  author       = {Ir{\`{e}}ne Durand and
                  Aart Middeldorp},
  title        = {Decidable call-by-need computations in term rewriting},
  journal      = {Inf. Comput.},
  volume       = {196},
  number       = {2},
  pages        = {95--126},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ic.2004.10.003},
  doi          = {10.1016/J.IC.2004.10.003},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/DurandM05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/FlamminiP05,
  author       = {Michele Flammini and
                  St{\'{e}}phane P{\'{e}}rennes},
  title        = {Lower bounds on systolic gossip},
  journal      = {Inf. Comput.},
  volume       = {196},
  number       = {2},
  pages        = {71--94},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ic.2004.09.002},
  doi          = {10.1016/J.IC.2004.09.002},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/FlamminiP05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Milius05,
  author       = {Stefan Milius},
  title        = {Completely iterative algebras and completely iterative monads},
  journal      = {Inf. Comput.},
  volume       = {196},
  number       = {1},
  pages        = {1--41},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ic.2004.05.003},
  doi          = {10.1016/J.IC.2004.05.003},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/Milius05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/TanHE05,
  author       = {Zhiyi Tan and
                  Yong He and
                  Leah Epstein},
  title        = {Optimal on-line algorithms for the uniform machine scheduling problem
                  with ordinal data},
  journal      = {Inf. Comput.},
  volume       = {196},
  number       = {1},
  pages        = {57--70},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ic.2004.10.002},
  doi          = {10.1016/J.IC.2004.10.002},
  timestamp    = {Thu, 28 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iandc/TanHE05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics