default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation and Computation, Volume 251
Volume 251, December 2016
- John Case, Timo Kötzing:
Strongly non-U-shaped language learning results by general techniques. 1-15 - Stefano Mazzanti
:
Regressive computations characterize logarithmic space. 16-35 - Andreas Galanis, Leslie Ann Goldberg:
The complexity of approximately counting in 2-spin systems on k-uniform bounded-degree hypergraphs. 36-66 - Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz:
Better abstractions for timed automata. 67-90 - Kitty Meeks, Alexander Scott:
The parameterised complexity of list problems on graphs of bounded treewidth. 91-103 - Fu Song, Zhilin Wu:
On temporal logics with data variable quantifications: Decidability and complexity. 104-139 - Robert Bredereck, Jiehua Chen, Piotr Faliszewski, André Nichterlein, Rolf Niedermeier:
Prices matter for the parameterized complexity of shift bribery. 140-164 - Guy Avni, Orna Kupferman, Tami Tamir:
Network-formation games with regular objectives. 165-178 - Meirav Zehavi:
Parameterized algorithms for the Module Motif problem. 179-193 - Sanjay Jain, Timo Kötzing, Frank Stephan:
Enlarging learnable classes. 194-207 - Yves Métivier, J. M. Robson, Akka Zemmari:
Randomised distributed MIS and colouring algorithms for rings with oriented edges in O(√(log n)) bit rounds. 208-214 - Artur Jez, Markus Lohrey:
Approximation of smallest linear tree grammar. 215-251 - Anna Gál, Jing-Tang Jang:
A generalization of Spira's theorem and circuits with small segregators or separators. 252-262 - Volker Diekert, Artur Jez, Wojciech Plandowski:
Finding all solutions of equations in free groups and monoids with involution. 263-286 - George Barmpalias, Andrew Lewis-Pye, Jason Teutsch:
Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers. 287-300 - Elena Zamaraeva:
On teaching sets of k-threshold functions. 301-313 - Sun-Yuan Hsieh, Chia-Wei Lee, Chien-Hsiang Huang:
Conditional edge-fault hamiltonian-connectivity of restricted hypercube-like networks. 314-334 - Daniel Hirschkoff, Jean-Marie Madiot, Davide Sangiorgi:
Name-passing calculi: From fusions to preorders and types. 335-360 - Guy Feigenblat, Ely Porat, Ariel Shiftan:
Addendum to 'Exponential time improvement for min-wise based algorithms' [Information and Computation 209 (2011) 737-747]. 361
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.
last updated on 2024-11-15 19:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
