Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/iandc/Cachin04,
  author    = {Christian Cachin},
  title     = {An information-theoretic model for steganography},
  journal   = {Inf. Comput.},
  volume    = {192},
  number    = {1},
  pages     = {41--56},
  year      = {2004},
  url       = {https://doi.org/10.1016/j.ic.2004.02.003},
  doi       = {10.1016/j.ic.2004.02.003},
  timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/iandc/Cachin04.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/CaseKSS04,
  author    = {John Case and
               Efim B. Kinber and
               Arun Sharma and
               Frank Stephan},
  title     = {On the classification of recursive languages},
  journal   = {Inf. Comput.},
  volume    = {192},
  number    = {1},
  pages     = {15--40},
  year      = {2004},
  url       = {https://doi.org/10.1016/j.ic.2004.03.001},
  doi       = {10.1016/j.ic.2004.03.001},
  timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/iandc/CaseKSS04.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Cleve04,
  author    = {Richard Cleve},
  title     = {The query complexity of order-finding},
  journal   = {Inf. Comput.},
  volume    = {192},
  number    = {2},
  pages     = {162--171},
  year      = {2004},
  url       = {https://doi.org/10.1016/j.ic.2004.04.001},
  doi       = {10.1016/j.ic.2004.04.001},
  timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/iandc/Cleve04.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/DeneckerMT04,
  author    = {Marc Denecker and
               Victor W. Marek and
               Miroslaw Truszczynski},
  title     = {Ultimate approximation and its application in nonmonotonic knowledge
               representation systems},
  journal   = {Inf. Comput.},
  volume    = {192},
  number    = {1},
  pages     = {84--121},
  year      = {2004},
  url       = {https://doi.org/10.1016/j.ic.2004.02.004},
  doi       = {10.1016/j.ic.2004.02.004},
  timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/iandc/DeneckerMT04.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Duris04,
  author    = {Pavol Duris},
  title     = {Multiparty communication complexity and very hard functions},
  journal   = {Inf. Comput.},
  volume    = {192},
  number    = {1},
  pages     = {1--14},
  year      = {2004},
  url       = {https://doi.org/10.1016/j.ic.2004.03.002},
  doi       = {10.1016/j.ic.2004.03.002},
  timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/iandc/Duris04.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/EllisM04,
  author    = {John A. Ellis and
               Minko Markov},
  title     = {Computing the vertex separation of unicyclic graphs},
  journal   = {Inf. Comput.},
  volume    = {192},
  number    = {2},
  pages     = {123--161},
  year      = {2004},
  url       = {https://doi.org/10.1016/j.ic.2004.03.005},
  doi       = {10.1016/j.ic.2004.03.005},
  timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/iandc/EllisM04.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/JainKW04,
  author    = {Sanjay Jain and
               Efim B. Kinber and
               Rolf Wiehagen},
  title     = {Learning all subfunctions of a function},
  journal   = {Inf. Comput.},
  volume    = {192},
  number    = {2},
  pages     = {185--215},
  year      = {2004},
  url       = {https://doi.org/10.1016/j.ic.2004.03.003},
  doi       = {10.1016/j.ic.2004.03.003},
  timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/iandc/JainKW04.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/LecomteR04,
  author    = {Pierre B. A. Lecomte and
               Michel Rigo},
  title     = {Real numbers having ultimately periodic representations in abstract
               numeration systems},
  journal   = {Inf. Comput.},
  volume    = {192},
  number    = {1},
  pages     = {57--83},
  year      = {2004},
  url       = {https://doi.org/10.1016/j.ic.2003.12.006},
  doi       = {10.1016/j.ic.2003.12.006},
  timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/iandc/LecomteR04.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/NederhofS04,
  author    = {Mark{-}Jan Nederhof and
               Giorgio Satta},
  title     = {The language intersection problem for non-recursive context-free grammars},
  journal   = {Inf. Comput.},
  volume    = {192},
  number    = {2},
  pages     = {172--184},
  year      = {2004},
  url       = {https://doi.org/10.1016/j.ic.2004.03.004},
  doi       = {10.1016/j.ic.2004.03.004},
  timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/iandc/NederhofS04.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics