|
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
111 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 1 | Absolute convergence of rational series is semi-decidable |
Bailly, Raphaël |
2011 |
228-229 | 3 |
p. 280-295 16 p. |
artikel |
|
| 2 | A classification of the expressive power of well-structured transition systems |
Abdulla, Parosh Aziz |
2011 |
228-229 | 3 |
p. 248-279 32 p. |
artikel |
|
| 3 | A fast algorithm for computing multiplicative inverses in GF(2 m ) using normal bases |
Itoh, Toshiya |
1988 |
228-229 | 3 |
p. 171-177 7 p. |
artikel |
|
| 4 | A general lower bound on the number of examples needed for learning |
Ehrenfeucht, Andrzej |
1989 |
228-229 | 3 |
p. 247-261 15 p. |
artikel |
|
| 5 | Algorithmically independent sequences |
Calude, Cristian S. |
2010 |
228-229 | 3 |
p. 292-308 17 p. |
artikel |
|
| 6 | An arithmetical hierarchy in propositional dynamic logic |
Istrail, Sorin |
1989 |
228-229 | 3 |
p. 280-289 10 p. |
artikel |
|
| 7 | An automata-theoretic approach to constraint LTL |
Demri, Stéphane |
2007 |
228-229 | 3 |
p. 380-415 36 p. |
artikel |
|
| 8 | An automata theoretic decision procedure for the propositional mu-calculus |
Streett, Robert S. |
1989 |
228-229 | 3 |
p. 249-264 16 p. |
artikel |
|
| 9 | An automaton decomposition for learning system environments |
Westerdale, T.H. |
1988 |
228-229 | 3 |
p. 179-191 13 p. |
artikel |
|
| 10 | An Ehrenfeucht-Fraïssé game approach to collapse results in database theory |
Schweikardt, Nicole |
2007 |
228-229 | 3 |
p. 311-379 69 p. |
artikel |
|
| 11 | A new look at fault-tolerant network routing |
Dolev, Danny |
1987 |
228-229 | 3 |
p. 180-196 17 p. |
artikel |
|
| 12 | Announcement |
1987 |
228-229 | 3 |
p. 250-251 2 p. |
artikel |
||
| 13 | Area-time optimal division for T = Ω((log n)1 + ε) |
Mehlhorn, K. |
1987 |
228-229 | 3 |
p. 270-282 13 p. |
artikel |
|
| 14 | A stable programming language |
Paolini, Luca |
2006 |
228-229 | 3 |
p. 339-375 37 p. |
artikel |
|
| 15 | Author index for volume 81 |
1989 |
228-229 | 3 |
p. 380- 1 p. |
artikel |
||
| 16 | Author index for volume 78 |
1988 |
228-229 | 3 |
p. 254- 1 p. |
artikel |
||
| 17 | Author index for volume 75 |
1987 |
228-229 | 3 |
p. 328- 1 p. |
artikel |
||
| 18 | Author index for volume 82 |
1989 |
228-229 | 3 |
p. 354- 1 p. |
artikel |
||
| 19 | Author index for volume 77 |
1988 |
228-229 | 3 |
p. 260- 1 p. |
artikel |
||
| 20 | Author index for volume 73 |
1987 |
228-229 | 3 |
p. 280- 1 p. |
artikel |
||
| 21 | Author index for volume 83 |
1989 |
228-229 | 3 |
p. 360-361 2 p. |
artikel |
||
| 22 | Author index for volume 79 |
1988 |
228-229 | 3 |
p. 280- 1 p. |
artikel |
||
| 23 | Author index for volume 72 |
1987 |
228-229 | 3 |
p. 283- 1 p. |
artikel |
||
| 24 | Author index for volume 74 |
1987 |
228-229 | 3 |
p. 252- 1 p. |
artikel |
||
| 25 | Author index for volume 80 |
1989 |
228-229 | 3 |
p. 289- 1 p. |
artikel |
||
| 26 | Bounded hairpin completion |
Ito, Masami |
2011 |
228-229 | 3 |
p. 471-485 15 p. |
artikel |
|
| 27 | Building species trees from larger parts of phylogenomic databases |
Scornavacca, C. |
2011 |
228-229 | 3 |
p. 590-605 16 p. |
artikel |
|
| 28 | Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages |
Sénizergues, G. |
1989 |
228-229 | 3 |
p. 265-279 15 p. |
artikel |
|
| 29 | Complexity characterizations of attribute grammar languages |
Efremidis, Sophocles |
1988 |
228-229 | 3 |
p. 178-186 9 p. |
artikel |
|
| 30 | Complexity theory of parallel time and hardware |
Dymond, Patrick W. |
1989 |
228-229 | 3 |
p. 205-226 22 p. |
artikel |
|
| 31 | Compositional semantics for real-time distributed computing |
Koymans, R. |
1988 |
228-229 | 3 |
p. 210-256 47 p. |
artikel |
|
| 32 | Computational complexity of the problem of tree generation under fine-grained access control policies |
Moore, Neil |
2011 |
228-229 | 3 |
p. 548-567 20 p. |
artikel |
|
| 33 | Convex powerdomains I |
Hrbacek, Karel |
1987 |
228-229 | 3 |
p. 198-225 28 p. |
artikel |
|
| 34 | Convex powerdomains II |
Hrbacek, Karel |
1989 |
228-229 | 3 |
p. 290-317 28 p. |
artikel |
|
| 35 | Corrigendum |
Afrati, Foto |
1989 |
228-229 | 3 |
p. 350-353 4 p. |
artikel |
|
| 36 | Cumulative subject index |
1989 |
228-229 | 3 |
p. 362-367 6 p. |
artikel |
||
| 37 | Cumulative subject index |
1987 |
228-229 | 3 |
p. 329-332 4 p. |
artikel |
||
| 38 | Cumulative subject index |
1988 |
228-229 | 3 |
p. 281-285 5 p. |
artikel |
||
| 39 | Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms |
Gabbay, Murdoch J. |
2010 |
228-229 | 3 |
p. 230-258 29 p. |
artikel |
|
| 40 | Decidability of operation problems for T0L languages and subclasses |
Bordihn, Henning |
2011 |
228-229 | 3 |
p. 344-352 9 p. |
artikel |
|
| 41 | Decision problems for convex languages |
Brzozowski, Janusz |
2011 |
228-229 | 3 |
p. 353-367 15 p. |
artikel |
|
| 42 | Descriptional and computational complexity of finite automata—A survey |
Holzer, Markus |
2011 |
228-229 | 3 |
p. 456-470 15 p. |
artikel |
|
| 43 | Easy multiplications I. The realm of Kleene's theorem |
Sakarovitch, Jacques |
1987 |
228-229 | 3 |
p. 173-197 25 p. |
artikel |
|
| 44 | Editorial Board |
2006 |
228-229 | 3 |
p. CO2- 1 p. |
artikel |
||
| 45 | Editorial Board |
2006 |
228-229 | 3 |
p. i- 1 p. |
artikel |
||
| 46 | Editorial Board |
2007 |
228-229 | 3 |
p. CO2- 1 p. |
artikel |
||
| 47 | Editorial Board (continued) |
2010 |
228-229 | 3 |
p. i- 1 p. |
artikel |
||
| 48 | Editorial Board (continued) |
2009 |
228-229 | 3 |
p. i- 1 p. |
artikel |
||
| 49 | Editorial Board (continued) |
2007 |
228-229 | 3 |
p. i- 1 p. |
artikel |
||
| 50 | Editorial Board (continued) |
2011 |
228-229 | 3 |
p. i- 1 p. |
artikel |
||
| 51 | Efficiency of the symmetry bias in grammar acquisition |
Matoba, Ryuichi |
2011 |
228-229 | 3 |
p. 536-547 12 p. |
artikel |
|
| 52 | Efficient algorithms for the block edit problems |
Ann, Hsing-Yen |
2010 |
228-229 | 3 |
p. 221-229 9 p. |
artikel |
|
| 53 | Existentially restricted quantified constraint satisfaction |
Chen, Hubie |
2009 |
228-229 | 3 |
p. 369-388 20 p. |
artikel |
|
| 54 | Expressiveness and complexity of graph logic |
Dawar, Anuj |
2007 |
228-229 | 3 |
p. 263-310 48 p. |
artikel |
|
| 55 | Fairness in context-free grammars under every choice-strategy |
Porat, Sara |
1989 |
228-229 | 3 |
p. 249-268 20 p. |
artikel |
|
| 56 | Faster optimal parallel prefix sums and list ranking |
Cole, Richard |
1989 |
228-229 | 3 |
p. 334-352 19 p. |
artikel |
|
| 57 | Fault tolerant computing and reliable communication: A unified approach |
Trachtenberg, E.A. |
1988 |
228-229 | 3 |
p. 257-279 23 p. |
artikel |
|
| 58 | Finite identification from the viewpoint of epistemic update |
Dégremont, Cédric |
2011 |
228-229 | 3 |
p. 383-396 14 p. |
artikel |
|
| 59 | Fixed point equations with parameters in the projective model |
Kranakis, Evangelos |
1987 |
228-229 | 3 |
p. 264-288 25 p. |
artikel |
|
| 60 | Global renaming operators in concrete process algebra |
Baeten, J.C.M. |
1988 |
228-229 | 3 |
p. 205-245 41 p. |
artikel |
|
| 61 | Hypothesis spaces for learning |
Jain, Sanjay |
2011 |
228-229 | 3 |
p. 513-527 15 p. |
artikel |
|
| 62 | Incompleteness of states w.r.t. traces in model checking |
Giacobazzi, Roberto |
2006 |
228-229 | 3 |
p. 376-407 32 p. |
artikel |
|
| 63 | Inferring decision trees using the minimum description lenght principle |
Ross Quinlan, J. |
1989 |
228-229 | 3 |
p. 227-248 22 p. |
artikel |
|
| 64 | Inside Front Cover: Editorial Board |
2010 |
228-229 | 3 |
p. IFC- 1 p. |
artikel |
||
| 65 | Inside Front Cover: Editorial Board |
2009 |
228-229 | 3 |
p. IFC- 1 p. |
artikel |
||
| 66 | Inside Front Cover: Editorial Board |
2011 |
228-229 | 3 |
p. IFC- 1 p. |
artikel |
||
| 67 | Larger lower bounds on the OBDD complexity of integer multiplication |
Bollig, Beate |
2011 |
228-229 | 3 |
p. 333-343 11 p. |
artikel |
|
| 68 | Learning decision trees from random examples |
Ehrenfeucht, Andrzej |
1989 |
228-229 | 3 |
p. 231-246 16 p. |
artikel |
|
| 69 | Limitations of lower bound methods for deterministic nested word automata |
Salomaa, Kai |
2011 |
228-229 | 3 |
p. 580-589 10 p. |
artikel |
|
| 70 | Linear numeration systems of order two |
Frougny, Christiane |
1988 |
228-229 | 3 |
p. 233-259 27 p. |
artikel |
|
| 71 | Linear-time simulation of multihead turing machines |
Schnitzlein, W. |
1989 |
228-229 | 3 |
p. 353-363 11 p. |
artikel |
|
| 72 | Look-ahead on pushdowns |
Engelfriet, Joost |
1987 |
228-229 | 3 |
p. 245-279 35 p. |
artikel |
|
| 73 | Minimum polygonal separation |
Edelsbrunner, H. |
1988 |
228-229 | 3 |
p. 218-232 15 p. |
artikel |
|
| 74 | Morphic characterizations of languages in Chomsky hierarchy with insertion and locality |
Fujioka, Kaoru |
2011 |
228-229 | 3 |
p. 397-408 12 p. |
artikel |
|
| 75 | Needed reduction and spine strategies for the lambda calculus |
Barendregt, H.P. |
1987 |
228-229 | 3 |
p. 191-231 41 p. |
artikel |
|
| 76 | On an algorithm determining direct superclasses in Java and similar languages with inner classes—Its correctness, completeness and uniqueness of solutions |
Langmaack, Hans |
2009 |
228-229 | 3 |
p. 389-410 22 p. |
artikel |
|
| 77 | One-way functions and circuit complexity |
Boppana, R.B. |
1987 |
228-229 | 3 |
p. 226-240 15 p. |
artikel |
|
| 78 | On model-checking timed automata with stopwatch observers |
Brihaye, Thomas |
2006 |
228-229 | 3 |
p. 408-433 26 p. |
artikel |
|
| 79 | On using deterministic functions to reduce randomness in probabilistic algorithms |
Santha, Miklos |
1987 |
228-229 | 3 |
p. 241-249 9 p. |
artikel |
|
| 80 | Operational domain theory and topology of sequential programming languages |
Escardó, Martı´n |
2009 |
228-229 | 3 |
p. 411-437 27 p. |
artikel |
|
| 81 | Optimal simulation of self-verifying automata by deterministic automata |
Jirásková, Galina |
2011 |
228-229 | 3 |
p. 528-535 8 p. |
artikel |
|
| 82 | Parallei graph algorithms that are efficient on average |
Coppersmith, Don |
1989 |
228-229 | 3 |
p. 318-333 16 p. |
artikel |
|
| 83 | Parallel approximation algorithms for bin packing |
Anderson, Richard J. |
1989 |
228-229 | 3 |
p. 262-277 16 p. |
artikel |
|
| 84 | Parallel processing can be harmful: The unusual behavior of interpolation search |
Willard, Dan E. |
1989 |
228-229 | 3 |
p. 364-379 16 p. |
artikel |
|
| 85 | Petri nets, algebras, morphisms, and compositionality |
Winskel, Glynn |
1987 |
228-229 | 3 |
p. 197-238 42 p. |
artikel |
|
| 86 | Proof systems that take advice |
Beyersdorff, Olaf |
2011 |
228-229 | 3 |
p. 320-332 13 p. |
artikel |
|
| 87 | Qualitative robustness in time series |
Papantoni-Kazakos, P. |
1987 |
228-229 | 3 |
p. 239-269 31 p. |
artikel |
|
| 88 | Queries on Xml streams with bounded delay and concurrency |
Gauwin, Olivier |
2011 |
228-229 | 3 |
p. 409-442 34 p. |
artikel |
|
| 89 | 3rd International Conference on Language and Automata Theory and Applications (LATA 2009) |
Martín-Vide, Carlos |
2011 |
228-229 | 3 |
p. 247- 1 p. |
artikel |
|
| 90 | Reasoning about procedures as parameters in the language L4 |
German, Steven M. |
1989 |
228-229 | 3 |
p. 265-359 95 p. |
artikel |
|
| 91 | Reductions among number theoretic problems |
Woll, Heather |
1987 |
228-229 | 3 |
p. 167-179 13 p. |
artikel |
|
| 92 | Revisiting constraint-directed search |
Ågren, Magnus |
2009 |
228-229 | 3 |
p. 438-457 20 p. |
artikel |
|
| 93 | Rigid tree automata and applications |
Jacquemard, Florent |
2011 |
228-229 | 3 |
p. 486-512 27 p. |
artikel |
|
| 94 | Safe states in Banker-like resource allocation problems |
Hauschildt, Dirk |
1987 |
228-229 | 3 |
p. 232-263 32 p. |
artikel |
|
| 95 | Saving the phenomena: Requirements that inductive inference machines not contradict known data |
Fulk, Mark A. |
1988 |
228-229 | 3 |
p. 193-209 17 p. |
artikel |
|
| 96 | Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi |
Mann, Matthias |
2010 |
228-229 | 3 |
p. 276-291 16 p. |
artikel |
|
| 97 | Some remarks on computing the square parts of integers |
Landau, Susan |
1988 |
228-229 | 3 |
p. 246-253 8 p. |
artikel |
|
| 98 | Synchronizing automata with finitely many minimal synchronizing words |
Pribavkina, Elena V. |
2011 |
228-229 | 3 |
p. 568-579 12 p. |
artikel |
|
| 99 | Teaching randomized learners with feedback |
Balbach, Frank J. |
2011 |
228-229 | 3 |
p. 296-319 24 p. |
artikel |
|
| 100 | The μ-calculus as an assertion-language for fairness arguments |
Stomp, F.A. |
1989 |
228-229 | 3 |
p. 278-322 45 p. |
artikel |
|
| 101 | The efficiency of identifying timed automata and the power of clocks |
Verwer, Sicco |
2011 |
228-229 | 3 |
p. 606-625 20 p. |
artikel |
|
| 102 | The fault tolerance of NP-hard problems |
Glaßer, Christian |
2011 |
228-229 | 3 |
p. 443-455 13 p. |
artikel |
|
| 103 | The iterated mod problem |
Karloff, Howard J. |
1989 |
228-229 | 3 |
p. 193-204 12 p. |
artikel |
|
| 104 | The logarithmic alternation hierarchy collapses: AΣ 2 L = AΠ 2 L |
Jenner, Birgit |
1989 |
228-229 | 3 |
p. 269-288 20 p. |
artikel |
|
| 105 | The OI-hierarchy is closed under control |
Vogler, Heiko |
1988 |
228-229 | 3 |
p. 187-204 18 p. |
artikel |
|
| 106 | The pursuit of deadlock freedom |
Roscoe, A.W. |
1987 |
228-229 | 3 |
p. 289-327 39 p. |
artikel |
|
| 107 | The role of evolutionary operations in accepting hybrid networks of evolutionary processors |
Dassow, Jürgen |
2011 |
228-229 | 3 |
p. 368-382 15 p. |
artikel |
|
| 108 | The word and generator problems for lattices |
Cosmadakis, Stavros S. |
1988 |
228-229 | 3 |
p. 192-217 26 p. |
artikel |
|
| 109 | Trade-off among parameters affecting inductive inference |
Freivalds, Rūsiņš |
1989 |
228-229 | 3 |
p. 323-349 27 p. |
artikel |
|
| 110 | Treewidth computations I. Upper bounds |
Bodlaender, Hans L. |
2010 |
228-229 | 3 |
p. 259-275 17 p. |
artikel |
|
| 111 | Weak and strong fairness in CCS |
Costa, Gerardo |
1987 |
228-229 | 3 |
p. 207-244 38 p. |
artikel |
111 gevonden resultaten