Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/iandc/Basset15,
  author       = {Nicolas Basset},
  title        = {A maximal entropy stochastic process for a timed automaton},
  journal      = {Inf. Comput.},
  volume       = {243},
  pages        = {50--74},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.ic.2014.12.006},
  doi          = {10.1016/J.IC.2014.12.006},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/Basset15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/BilleGLW15,
  author       = {Philip Bille and
                  Inge Li G{\o}rtz and
                  Gad M. Landau and
                  Oren Weimann},
  title        = {Tree compression with top trees},
  journal      = {Inf. Comput.},
  volume       = {243},
  pages        = {166--177},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.ic.2014.12.012},
  doi          = {10.1016/J.IC.2014.12.012},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/BilleGLW15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/Blaser15,
  author       = {Markus Bl{\"{a}}ser},
  title        = {Noncommutativity makes determinants hard},
  journal      = {Inf. Comput.},
  volume       = {243},
  pages        = {133--144},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.ic.2014.12.010},
  doi          = {10.1016/J.IC.2014.12.010},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/Blaser15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/BodlaenderCKN15,
  author       = {Hans L. Bodlaender and
                  Marek Cygan and
                  Stefan Kratsch and
                  Jesper Nederlof},
  title        = {Deterministic single exponential time algorithms for connectivity
                  problems parameterized by treewidth},
  journal      = {Inf. Comput.},
  volume       = {243},
  pages        = {86--111},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.ic.2014.12.008},
  doi          = {10.1016/J.IC.2014.12.008},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/BodlaenderCKN15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/BunT15,
  author       = {Mark Bun and
                  Justin Thaler},
  title        = {Dual lower bounds for approximate degree and Markov-Bernstein inequalities},
  journal      = {Inf. Comput.},
  volume       = {243},
  pages        = {2--25},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.ic.2014.12.003},
  doi          = {10.1016/J.IC.2014.12.003},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/BunT15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/CyganP15,
  author       = {Marek Cygan and
                  Marcin Pilipczuk},
  title        = {Faster exponential-time algorithms in graphs of bounded average degree},
  journal      = {Inf. Comput.},
  volume       = {243},
  pages        = {75--85},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.ic.2014.12.007},
  doi          = {10.1016/J.IC.2014.12.007},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/CyganP15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/DereniowskiDKPU15,
  author       = {Dariusz Dereniowski and
                  Yann Disser and
                  Adrian Kosowski and
                  Dominik Pajak and
                  Przemyslaw Uznanski},
  title        = {Fast collaborative graph exploration},
  journal      = {Inf. Comput.},
  volume       = {243},
  pages        = {37--49},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.ic.2014.12.005},
  doi          = {10.1016/J.IC.2014.12.005},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/DereniowskiDKPU15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/DuanM15,
  author       = {Ran Duan and
                  Kurt Mehlhorn},
  title        = {A combinatorial polynomial algorithm for the linear Arrow-Debreu market},
  journal      = {Inf. Comput.},
  volume       = {243},
  pages        = {112--132},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.ic.2014.12.009},
  doi          = {10.1016/J.IC.2014.12.009},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/DuanM15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/FearnleyJ15,
  author       = {John Fearnley and
                  Marcin Jurdzinski},
  title        = {Reachability in two-clock timed automata is PSPACE-complete},
  journal      = {Inf. Comput.},
  volume       = {243},
  pages        = {26--36},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.ic.2014.12.004},
  doi          = {10.1016/J.IC.2014.12.004},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/FearnleyJ15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/FominKP15,
  author       = {Fedor V. Fomin and
                  Marta Z. Kwiatkowska and
                  David Peleg},
  title        = {40th international colloquium on automata, languages and programming},
  journal      = {Inf. Comput.},
  volume       = {243},
  pages        = {1},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.ic.2014.12.002},
  doi          = {10.1016/J.IC.2014.12.002},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/FominKP15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/GurR15,
  author       = {Tom Gur and
                  Ran Raz},
  title        = {Arthur-Merlin streaming complexity},
  journal      = {Inf. Comput.},
  volume       = {243},
  pages        = {145--165},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.ic.2014.12.011},
  doi          = {10.1016/J.IC.2014.12.011},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iandc/GurR15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/HartungNNS15,
  author       = {Sepp Hartung and
                  Andr{\'{e}} Nichterlein and
                  Rolf Niedermeier and
                  Ondrej Such{\'{y}}},
  title        = {A refined complexity analysis of degree anonymization in graphs},
  journal      = {Inf. Comput.},
  volume       = {243},
  pages        = {249--262},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.ic.2014.12.017},
  doi          = {10.1016/J.IC.2014.12.017},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/HartungNNS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/HemenwayOW15,
  author       = {Brett Hemenway and
                  Rafail Ostrovsky and
                  Mary Wootters},
  title        = {Local correctability of expander codes},
  journal      = {Inf. Comput.},
  volume       = {243},
  pages        = {178--190},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.ic.2014.12.013},
  doi          = {10.1016/J.IC.2014.12.013},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/HemenwayOW15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/Janin15,
  author       = {David Janin},
  title        = {On labeled birooted tree languages: Algebras, automata and logic},
  journal      = {Inf. Comput.},
  volume       = {243},
  pages        = {222--248},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.ic.2014.12.016},
  doi          = {10.1016/J.IC.2014.12.016},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/Janin15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/KobeleS15,
  author       = {Gregory M. Kobele and
                  Sylvain Salvati},
  title        = {The {IO} and {OI} hierarchies revisited},
  journal      = {Inf. Comput.},
  volume       = {243},
  pages        = {205--221},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.ic.2014.12.015},
  doi          = {10.1016/J.IC.2014.12.015},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/KobeleS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/LohreySZ15,
  author       = {Markus Lohrey and
                  Benjamin Steinberg and
                  Georg Zetzsche},
  title        = {Rational subsets and submonoids of wreath products},
  journal      = {Inf. Comput.},
  volume       = {243},
  pages        = {191--204},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.ic.2014.12.014},
  doi          = {10.1016/J.IC.2014.12.014},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/LohreySZ15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/PettieS15,
  author       = {Seth Pettie and
                  Hsin{-}Hao Su},
  title        = {Distributed coloring algorithms for triangle-free graphs},
  journal      = {Inf. Comput.},
  volume       = {243},
  pages        = {263--280},
  year         = {2015},
  url          = {https://doi.org/10.1016/j.ic.2014.12.018},
  doi          = {10.1016/J.IC.2014.12.018},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/PettieS15.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.