|
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
55 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 1 | Abstract model repair for probabilistic systems |
Chatzieleftheriou, G. |
2018 |
228-229 | P1 |
p. 142-160 |
artikel |
|
| 2 | Alignment-free sequence comparison using absent words |
Charalampopoulos, Panagiotis |
2018 |
228-229 | P1 |
p. 57-68 |
artikel |
|
| 3 | Alternating space is closed under complement and other simulations for sublogarithmic space |
Geffert, Viliam |
2017 |
228-229 | P1 |
p. 163-178 16 p. |
artikel |
|
| 4 | Analyzing pushdown systems with stack manipulation |
Song, Fu |
2018 |
228-229 | P1 |
p. 41-71 |
artikel |
|
| 5 | A procedure for deciding symbolic equivalence between sets of constraint systems |
Cheval, Vincent |
2017 |
228-229 | P1 |
p. 94-125 32 p. |
artikel |
|
| 6 | A semantic theory of the Internet of Things |
Lanotte, Ruggero |
2018 |
228-229 | P1 |
p. 72-101 |
artikel |
|
| 7 | A type-based complexity analysis of Object Oriented programs |
Hainry, Emmanuel |
2018 |
228-229 | P1 |
p. 78-115 |
artikel |
|
| 8 | Automatic learning from positive data and negative counterexamples |
Jain, Sanjay |
2017 |
228-229 | P1 |
p. 45-67 23 p. |
artikel |
|
| 9 | Best of two local models: Centralized local and distributed local algorithms |
Even, Guy |
2018 |
228-229 | P1 |
p. 69-89 |
artikel |
|
| 10 | Brudno's theorem for Z d (or Z + d ) subshifts |
Fuda, Toru |
2017 |
228-229 | P1 |
p. 155-162 8 p. |
artikel |
|
| 11 | Characterizing polynomial and exponential complexity classes in elementary lambda-calculus |
Baillot, Patrick |
2018 |
228-229 | P1 |
p. 55-77 |
artikel |
|
| 12 | Classes of languages generated by the Kleene star of a word |
Daviaud, Laure |
2018 |
228-229 | P1 |
p. 90-109 |
artikel |
|
| 13 | Complexity bounds for container functors and comonads |
Orchard, Dominic |
2018 |
228-229 | P1 |
p. 144-158 |
artikel |
|
| 14 | Complexity classification of the six-vertex model |
Cai, Jin-Yi |
2018 |
228-229 | P1 |
p. 130-141 |
artikel |
|
| 15 | Complexity of universality and related problems for partially ordered NFAs |
Krötzsch, Markus |
2017 |
228-229 | P1 |
p. 177-192 16 p. |
artikel |
|
| 16 | CTL* with graded path modalities |
Aminof, Benjamin |
2018 |
228-229 | P1 |
p. 1-21 |
artikel |
|
| 17 | Deciding game invariance |
Duchêne, Eric |
2017 |
228-229 | P1 |
p. 127-142 16 p. |
artikel |
|
| 18 | Diagonally non-computable functions and fireworks |
Bienvenu, Laurent |
2017 |
228-229 | P1 |
p. 64-77 14 p. |
artikel |
|
| 19 | Differential privacy in probabilistic systems |
Yang, Jiannan |
2017 |
228-229 | P1 |
p. 84-104 21 p. |
artikel |
|
| 20 | Distinguishing between communicating transactions |
Koutavas, Vasileios |
2018 |
228-229 | P1 |
p. 1-30 |
artikel |
|
| 21 | Doing-it-All with bounded work and communication |
Chlebus, Bogdan S. |
2017 |
228-229 | P1 |
p. 1-40 40 p. |
artikel |
|
| 22 | Editorial Board |
2017 |
228-229 | P1 |
p. i- 1 p. |
artikel |
||
| 23 | Editorial Board |
2017 |
228-229 | P1 |
p. IFC- 1 p. |
artikel |
||
| 24 | Editorial Board |
2017 |
228-229 | P1 |
p. IFC- 1 p. |
artikel |
||
| 25 | Editorial Board |
2017 |
228-229 | P1 |
p. IFC- 1 p. |
artikel |
||
| 26 | Editorial Board |
2017 |
228-229 | P1 |
p. i- 1 p. |
artikel |
||
| 27 | Editorial Board |
2018 |
228-229 | P1 |
p. ii |
artikel |
||
| 28 | Editorial Board |
2018 |
228-229 | P1 |
p. ii |
artikel |
||
| 29 | Editorial Board |
2018 |
228-229 | P1 |
p. ii |
artikel |
||
| 30 | Equivalences between learning of data and probability distributions, and their applications |
Barmpalias, George |
2018 |
228-229 | P1 |
p. 123-140 |
artikel |
|
| 31 | Exact algorithms for maximum independent set |
Xiao, Mingyu |
2017 |
228-229 | P1 |
p. 126-146 21 p. |
artikel |
|
| 32 | From Jinja bytecode to term rewriting: A complexity reflecting transformation |
Moser, Georg |
2018 |
228-229 | P1 |
p. 116-143 |
artikel |
|
| 33 | Further remarks on DNA overlap assembly |
Enaganti, Srujan Kumar |
2017 |
228-229 | P1 |
p. 143-154 12 p. |
artikel |
|
| 34 | Holographic algorithms beyond matchgates |
Cai, Jin-Yi |
2018 |
228-229 | P1 |
p. 102-129 |
artikel |
|
| 35 | Improved bounds for randomized preemptive online matching |
Epstein, Leah |
2018 |
228-229 | P1 |
p. 31-40 |
artikel |
|
| 36 | Inapproximability results for constrained approximate Nash equilibria |
Deligkas, Argyrios |
2018 |
228-229 | P1 |
p. 40-56 |
artikel |
|
| 37 | Modeling concurrency with interval traces |
Janicki, Ryszard |
2017 |
228-229 | P1 |
p. 78-108 31 p. |
artikel |
|
| 38 | Non computable Mandelbrot-like sets for a one-parameter complex family |
Coronel, Daniel |
2018 |
228-229 | P1 |
p. 110-122 |
artikel |
|
| 39 | On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids |
Cain, Alan J. |
2017 |
228-229 | P1 |
p. 68-93 26 p. |
artikel |
|
| 40 | Online algorithms with advice: The tape model |
Böckenhauer, Hans-Joachim |
2017 |
228-229 | P1 |
p. 59-83 25 p. |
artikel |
|
| 41 | On sharing, memoization, and polynomial time |
Avanzini, Martin |
2018 |
228-229 | P1 |
p. 3-22 |
artikel |
|
| 42 | On the complexity of noncommutative polynomial factorization |
Arvind, V. |
2018 |
228-229 | P1 |
p. 22-39 |
artikel |
|
| 43 | On the state complexity of operations on two-way finite automata |
Jirásková, Galina |
2017 |
228-229 | P1 |
p. 36-63 28 p. |
artikel |
|
| 44 | Ordinal recursive complexity of Unordered Data Nets |
Rosa-Velardo, Fernando |
2017 |
228-229 | P1 |
p. 41-58 18 p. |
artikel |
|
| 45 | Paths-based criteria and application to linear logic subsystems characterizing polynomial time |
Perrinel, Matthieu |
2018 |
228-229 | P1 |
p. 23-54 |
artikel |
|
| 46 | Quantitative model-checking of controlled discrete-time Markov processes |
Tkachev, Ilya |
2017 |
228-229 | P1 |
p. 1-35 35 p. |
artikel |
|
| 47 | Space proof complexity for random 3-CNFs |
Bennett, Patrick |
2017 |
228-229 | P1 |
p. 165-176 12 p. |
artikel |
|
| 48 | Special issue – Developments in implicit computational complexity, 2014 and 2015 |
Gaboardi, Marco |
2018 |
228-229 | P1 |
p. 1-2 |
artikel |
|
| 49 | Synchronization of Bernoulli sequences on shared letters |
Abbes, Samy |
2017 |
228-229 | P1 |
p. 1-26 26 p. |
artikel |
|
| 50 | The quest for minimal quotients for probabilistic and Markov automata |
Eisentraut, Christian |
2018 |
228-229 | P1 |
p. 162-186 |
artikel |
|
| 51 | The treewidth of proofs |
Müller, Moritz |
2017 |
228-229 | P1 |
p. 147-164 18 p. |
artikel |
|
| 52 | The vectorial λ-calculus |
Arrighi, Pablo |
2017 |
228-229 | P1 |
p. 105-139 35 p. |
artikel |
|
| 53 | Understanding cutting planes for QBFs |
Beyersdorff, Olaf |
2018 |
228-229 | P1 |
p. 141-161 |
artikel |
|
| 54 | Unit interval editing is fixed-parameter tractable |
Cao, Yixin |
2017 |
228-229 | P1 |
p. 109-126 18 p. |
artikel |
|
| 55 | Weighted automata on infinite words in the context of Attacker–Defender games |
Halava, V. |
2017 |
228-229 | P1 |
p. 27-44 18 p. |
artikel |
55 gevonden resultaten