Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/iandc/AcetoHS13,
  author       = {Luca Aceto and
                  Monika Henzinger and
                  Jir{\'{\i}} Sgall},
  title        = {38th International Colloquium on Automata, Languages and Programming},
  journal      = {Inf. Comput.},
  volume       = {222},
  pages        = {1},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.ic.2012.11.002},
  doi          = {10.1016/J.IC.2012.11.002},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/AcetoHS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/AhnG13,
  author       = {Kook Jin Ahn and
                  Sudipto Guha},
  title        = {Linear programming in the semi-streaming model with application to
                  the maximum matching problem},
  journal      = {Inf. Comput.},
  volume       = {222},
  pages        = {59--79},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.ic.2012.10.006},
  doi          = {10.1016/J.IC.2012.10.006},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/AhnG13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/AllenderFG13,
  author       = {Eric Allender and
                  Luke Friedman and
                  William I. Gasarch},
  title        = {Limits on the computational power of random strings},
  journal      = {Inf. Comput.},
  volume       = {222},
  pages        = {80--92},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.ic.2011.09.008},
  doi          = {10.1016/J.IC.2011.09.008},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iandc/AllenderFG13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/BeeckenMS13,
  author       = {Malte Beecken and
                  Johannes Mittmann and
                  Nitin Saxena},
  title        = {Algebraic independence and blackbox identity testing},
  journal      = {Inf. Comput.},
  volume       = {222},
  pages        = {2--19},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.ic.2012.10.004},
  doi          = {10.1016/J.IC.2012.10.004},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/BeeckenMS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/BermanBMRY13,
  author       = {Piotr Berman and
                  Arnab Bhattacharyya and
                  Konstantin Makarychev and
                  Sofya Raskhodnikova and
                  Grigory Yaroslavtsev},
  title        = {Approximation algorithms for spanner problems and Directed Steiner
                  Forest},
  journal      = {Inf. Comput.},
  volume       = {222},
  pages        = {93--107},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.ic.2012.10.007},
  doi          = {10.1016/J.IC.2012.10.007},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/BermanBMRY13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/BovaCV13,
  author       = {Simone Bova and
                  Hubie Chen and
                  Matthew Valeriote},
  title        = {Generic expression hardness results for primitive positive formula
                  comparison},
  journal      = {Inf. Comput.},
  volume       = {222},
  pages        = {108--120},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.ic.2012.10.008},
  doi          = {10.1016/J.IC.2012.10.008},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iandc/BovaCV13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/BrazdilBEK13,
  author       = {Tom{\'{a}}s Br{\'{a}}zdil and
                  V{\'{a}}clav Brozek and
                  Kousha Etessami and
                  Anton{\'{\i}}n Kucera},
  title        = {Approximating the termination value of one-counter MDPs and stochastic
                  games},
  journal      = {Inf. Comput.},
  volume       = {222},
  pages        = {121--138},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.ic.2012.01.008},
  doi          = {10.1016/J.IC.2012.01.008},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/BrazdilBEK13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/Chechik13,
  author       = {Shiri Chechik},
  title        = {Fault-tolerant compact routing schemes for general graphs},
  journal      = {Inf. Comput.},
  volume       = {222},
  pages        = {36--44},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.ic.2012.10.009},
  doi          = {10.1016/J.IC.2012.10.009},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/Chechik13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/DengH13,
  author       = {Yuxin Deng and
                  Matthew Hennessy},
  title        = {On the semantics of Markov automata},
  journal      = {Inf. Comput.},
  volume       = {222},
  pages        = {139--168},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.ic.2012.10.010},
  doi          = {10.1016/J.IC.2012.10.010},
  timestamp    = {Thu, 23 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iandc/DengH13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/DurocherHMNS13,
  author       = {Stephane Durocher and
                  Meng He and
                  J. Ian Munro and
                  Patrick K. Nicholson and
                  Matthew Skala},
  title        = {Range majority in constant time and linear space},
  journal      = {Inf. Comput.},
  volume       = {222},
  pages        = {169--179},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.ic.2012.10.011},
  doi          = {10.1016/J.IC.2012.10.011},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/DurocherHMNS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/Hoefer13,
  author       = {Martin Hoefer},
  title        = {Local matching dynamics in social networks},
  journal      = {Inf. Comput.},
  volume       = {222},
  pages        = {20--35},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.ic.2012.10.005},
  doi          = {10.1016/J.IC.2012.10.005},
  timestamp    = {Fri, 26 Mar 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/Hoefer13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/HuangK13,
  author       = {Chien{-}Chung Huang and
                  Telikepalli Kavitha},
  title        = {Popular matchings in the stable marriage problem},
  journal      = {Inf. Comput.},
  volume       = {222},
  pages        = {180--194},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.ic.2012.10.012},
  doi          = {10.1016/J.IC.2012.10.012},
  timestamp    = {Tue, 24 Jan 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/HuangK13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/JansenS13,
  author       = {Maurice J. Jansen and
                  Rahul Santhanam},
  title        = {Permanent does not have succinct polynomial size arithmetic circuits
                  of constant depth},
  journal      = {Inf. Comput.},
  volume       = {222},
  pages        = {195--207},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.ic.2012.10.013},
  doi          = {10.1016/J.IC.2012.10.013},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/JansenS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/Kapoutsis13,
  author       = {Christos A. Kapoutsis},
  title        = {Nondeterminism is essential in small two-way finite automata with
                  few reversals},
  journal      = {Inf. Comput.},
  volume       = {222},
  pages        = {208--227},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.ic.2012.11.001},
  doi          = {10.1016/J.IC.2012.11.001},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/Kapoutsis13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/Katsumata13,
  author       = {Shin{-}ya Katsumata},
  title        = {Relating computational effects by {\(\top\)}{\(\top\)}-lifting},
  journal      = {Inf. Comput.},
  volume       = {222},
  pages        = {228--246},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.ic.2012.10.014},
  doi          = {10.1016/J.IC.2012.10.014},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iandc/Katsumata13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/KuhnM13,
  author       = {Fabian Kuhn and
                  Monaldo Mastrolilli},
  title        = {Vertex cover in graphs with locally few colors},
  journal      = {Inf. Comput.},
  volume       = {222},
  pages        = {265--277},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.ic.2011.12.008},
  doi          = {10.1016/J.IC.2011.12.008},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/KuhnM13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/LairdMM13,
  author       = {Jim Laird and
                  Giulio Manzonetto and
                  Guy McCusker},
  title        = {Constructing differential categories and deconstructing categories
                  of games},
  journal      = {Inf. Comput.},
  volume       = {222},
  pages        = {247--264},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.ic.2012.10.015},
  doi          = {10.1016/J.IC.2012.10.015},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/LairdMM13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/Li13,
  author       = {Shi Li},
  title        = {A 1.488 approximation algorithm for the uncapacitated facility location
                  problem},
  journal      = {Inf. Comput.},
  volume       = {222},
  pages        = {45--58},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.ic.2012.01.007},
  doi          = {10.1016/J.IC.2012.01.007},
  timestamp    = {Thu, 29 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/iandc/Li13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/LokshtanovM13,
  author       = {Daniel Lokshtanov and
                  D{\'{a}}niel Marx},
  title        = {Clustering with local restrictions},
  journal      = {Inf. Comput.},
  volume       = {222},
  pages        = {278--292},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.ic.2012.10.016},
  doi          = {10.1016/J.IC.2012.10.016},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/LokshtanovM13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/iandc/Moldenhauer13,
  author       = {Carsten Moldenhauer},
  title        = {Primal-dual approximation algorithms for Node-Weighted Steiner Forest
                  on planar graphs},
  journal      = {Inf. Comput.},
  volume       = {222},
  pages        = {293--306},
  year         = {2013},
  url          = {https://doi.org/10.1016/j.ic.2012.10.017},
  doi          = {10.1016/J.IC.2012.10.017},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/Moldenhauer13.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.