|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
19 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | A combinatorial polynomial algorithm for the linear Arrow–Debreu market |
Duan, Ran |
2015 |
243 | C |
p. 112-132 21 p. |
article |
|
| 2 | A maximal entropy stochastic process for a timed automaton |
Basset, Nicolas |
2015 |
243 | C |
p. 50-74 25 p. |
article |
|
| 3 | A refined complexity analysis of degree anonymization in graphs |
Hartung, Sepp |
2015 |
243 | C |
p. 249-262 14 p. |
article |
|
| 4 | Arthur–Merlin streaming complexity |
Gur, Tom |
2015 |
243 | C |
p. 145-165 21 p. |
article |
|
| 5 | Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth |
Bodlaender, Hans L. |
2015 |
243 | C |
p. 86-111 26 p. |
article |
|
| 6 | Distributed coloring algorithms for triangle-free graphs |
Pettie, Seth |
2015 |
243 | C |
p. 263-280 18 p. |
article |
|
| 7 | Dual lower bounds for approximate degree and Markov–Bernstein inequalities |
Bun, Mark |
2015 |
243 | C |
p. 2-25 24 p. |
article |
|
| 8 | Editorial Board |
2015 |
243 | C |
p. IFC- 1 p. |
article |
||
| 9 | Editorial Board |
2015 |
243 | C |
p. i- 1 p. |
article |
||
| 10 | Fast collaborative graph exploration |
Dereniowski, Dariusz |
2015 |
243 | C |
p. 37-49 13 p. |
article |
|
| 11 | Faster exponential-time algorithms in graphs of bounded average degree |
Cygan, Marek |
2015 |
243 | C |
p. 75-85 11 p. |
article |
|
| 12 | Local correctability of expander codes |
Hemenway, Brett |
2015 |
243 | C |
p. 178-190 13 p. |
article |
|
| 13 | Noncommutativity makes determinants hard |
Bläser, Markus |
2015 |
243 | C |
p. 133-144 12 p. |
article |
|
| 14 | On labeled birooted tree languages: Algebras, automata and logic |
Janin, David |
2015 |
243 | C |
p. 222-248 27 p. |
article |
|
| 15 | Rational subsets and submonoids of wreath products |
Lohrey, Markus |
2015 |
243 | C |
p. 191-204 14 p. |
article |
|
| 16 | Reachability in two-clock timed automata is PSPACE-complete |
Fearnley, John |
2015 |
243 | C |
p. 26-36 11 p. |
article |
|
| 17 | The IO and OI hierarchies revisited |
Kobele, Gregory M. |
2015 |
243 | C |
p. 205-221 17 p. |
article |
|
| 18 | 40th international colloquium on automata, languages and programming |
Fomin, Fedor V. |
2015 |
243 | C |
p. 1- 1 p. |
article |
|
| 19 | Tree compression with top trees |
Bille, Philip |
2015 |
243 | C |
p. 166-177 12 p. |
article |
19 results found