|
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
64 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 1 | A coinductive calculus of binary trees |
Silva, Alexandra |
2010 |
5 |
p. 578-593 16 p. |
artikel |
||
| 2 | A computable approach to measure and integration theory |
Edalat, Abbas |
2009 |
5 |
p. 642-659 18 p. |
artikel |
||
| 3 | Adjunct elimination in Context Logic for trees |
Calcagno, Cristiano |
2010 |
5 |
p. 474-499 26 p. |
artikel |
||
| 4 | A logical duality for underspecified probabilistic systems |
Desharnais, Josée |
2011 |
5 |
p. 850-871 22 p. |
artikel |
||
| 5 | A modular and parameterized presentation of pregroup calculus |
Foret, Annie |
2010 |
5 |
p. 510-520 11 p. |
artikel |
||
| 6 | A new mapping between combinatorial proofs and sequent calculus proofs read out from logical flow graphs |
Carbone, Alessandra |
2010 |
5 |
p. 500-509 10 p. |
artikel |
||
| 7 | Aperiodic propagation criteria for Boolean functions |
Danielsen, Lars Eirik |
2006 |
5 |
p. 741-770 30 p. |
artikel |
||
| 8 | Applications of infinitary lambda calculus |
Barendregt, Henk |
2009 |
5 |
p. 559-582 24 p. |
artikel |
||
| 9 | A saturation method for the modal μ-calculus over pushdown systems |
Hague, M. |
2011 |
5 |
p. 799-821 23 p. |
artikel |
||
| 10 | A sketch of a dynamic epistemic semiring |
Solin, Kim |
2010 |
5 |
p. 594-604 11 p. |
artikel |
||
| 11 | Bin packing problems with rejection penalties and their dual problems |
Dósa, György |
2006 |
5 |
p. 795-815 21 p. |
artikel |
||
| 12 | Broadcast in the rendezvous model |
Duchon, Philippe |
2006 |
5 |
p. 697-712 16 p. |
artikel |
||
| 13 | Comparing reductions to NP-complete sets |
Hitchcock, John M. |
2007 |
5 |
p. 694-706 13 p. |
artikel |
||
| 14 | Continuation semantics for the Lambek–Grishin calculus |
Bernardi, Raffaella |
2010 |
5 |
p. 397-416 20 p. |
artikel |
||
| 15 | Deciding expressive description logics in the framework of resolution |
Hustadt, Ullrich |
2008 |
5 |
p. 579-601 23 p. |
artikel |
||
| 16 | Editorial Board |
2007 |
5 |
p. IFC- 1 p. |
artikel |
|||
| 17 | Editorial Board |
2006 |
5 |
p. CO2- 1 p. |
artikel |
|||
| 18 | Editorial Board |
2006 |
5 |
p. i- 1 p. |
artikel |
|||
| 19 | Editorial Board (continued) |
2010 |
5 |
p. i- 1 p. |
artikel |
|||
| 20 | Editorial Board (continued) |
2008 |
5 |
p. i- 1 p. |
artikel |
|||
| 21 | Editorial Board (continued) |
2007 |
5 |
p. i- 1 p. |
artikel |
|||
| 22 | Editorial Board (continued) |
2009 |
5 |
p. i- 1 p. |
artikel |
|||
| 23 | Editorial Board (continued) |
2011 |
5 |
p. i- 1 p. |
artikel |
|||
| 24 | Extended visual cryptography schemes |
Klein, Andreas |
2007 |
5 |
p. 716-732 17 p. |
artikel |
||
| 25 | From exact sciences to life phenomena: Following Schrödinger and Turing on Programs, Life and Causality |
Longo, Giuseppe |
2009 |
5 |
p. 545-558 14 p. |
artikel |
||
| 26 | Functional interpretations of linear and intuitionistic logic |
Oliva, Paulo |
2010 |
5 |
p. 565-577 13 p. |
artikel |
||
| 27 | Generalizing the Paige–Tarjan algorithm by abstract interpretation |
Ranzato, Francesco |
2008 |
5 |
p. 620-651 32 p. |
artikel |
||
| 28 | Graph connectivity, partial words, and a theorem of Fine and Wilf |
Blanchet-Sadri, F. |
2008 |
5 |
p. 676-693 18 p. |
artikel |
||
| 29 | Graph Isomorphism is in SPP |
Arvind, V. |
2006 |
5 |
p. 835-852 18 p. |
artikel |
||
| 30 | Hybrid logical analyses of the ambient calculus |
Bolander, Thomas |
2010 |
5 |
p. 433-449 17 p. |
artikel |
||
| 31 | Inside Front Cover: Editorial Board |
2010 |
5 |
p. IFC- 1 p. |
artikel |
|||
| 32 | Inside Front Cover: Editorial Board |
2008 |
5 |
p. IFC- 1 p. |
artikel |
|||
| 33 | Inside Front Cover: Editorial Board |
2009 |
5 |
p. IFC- 1 p. |
artikel |
|||
| 34 | Inside Front Cover: Editorial Board |
2011 |
5 |
p. IFC- 1 p. |
artikel |
|||
| 35 | Logic, language, information and computation |
Leivant, Daniel |
2010 |
5 |
p. 395-396 2 p. |
artikel |
||
| 36 | Model-checking games for fixpoint logics with partial order models |
Gutierrez, Julian |
2011 |
5 |
p. 766-781 16 p. |
artikel |
||
| 37 | Modules over monads and initial semantics |
Hirschowitz, André |
2010 |
5 |
p. 545-564 20 p. |
artikel |
||
| 38 | Numerical constraints on XML data |
Hartmann, Sven |
2010 |
5 |
p. 521-544 24 p. |
artikel |
||
| 39 | Objects and session types |
Dezani-Ciancaglini, Mariangiola |
2009 |
5 |
p. 595-641 47 p. |
artikel |
||
| 40 | On finite alphabets and infinite bases |
Chen, Taolue |
2008 |
5 |
p. 492-519 28 p. |
artikel |
||
| 41 | On quantifier-rank equivalence between linear orders |
Siders, Ryan |
2010 |
5 |
p. 417-432 16 p. |
artikel |
||
| 42 | On the completeness of order-theoretic models of the λ-calculus |
Honsell, Furio |
2009 |
5 |
p. 583-594 12 p. |
artikel |
||
| 43 | Partially-commutative context-free processes: Expressibility and tractability |
Czerwiński, Wojciech |
2011 |
5 |
p. 782-798 17 p. |
artikel |
||
| 44 | Polynomial certificates for propositional classes |
Arias, Marta |
2006 |
5 |
p. 816-834 19 p. |
artikel |
||
| 45 | Preemptive scheduling on a small number of hierarchical machines |
Dósa, György |
2008 |
5 |
p. 602-619 18 p. |
artikel |
||
| 46 | Preface |
Amadio, Roberto M. |
2009 |
5 |
p. 543-544 2 p. |
artikel |
||
| 47 | Quantitative analysis of probabilistic lossy channel systems |
Rabinovich, Alexander |
2006 |
5 |
p. 713-740 28 p. |
artikel |
||
| 48 | Quantitative Kleene coalgebras |
Silva, Alexandra |
2011 |
5 |
p. 822-849 28 p. |
artikel |
||
| 49 | Quasi-optimal energy-efficient leader election algorithms in radio networks |
Lavault, Christian |
2007 |
5 |
p. 679-693 15 p. |
artikel |
||
| 50 | Reachability in recursive Markov decision processes |
Brázdil, Tomáš |
2008 |
5 |
p. 520-537 18 p. |
artikel |
||
| 51 | Semiclassical analysis and sensitivity to initial conditions |
Paul, Thierry |
2009 |
5 |
p. 660-669 10 p. |
artikel |
||
| 52 | Special issue: CONCUR 2006 |
Baier, Christel |
2008 |
5 |
p. 491- 1 p. |
artikel |
||
| 53 | Structured anaphora to quantifier domains |
Brasoveanu, Adrian |
2010 |
5 |
p. 450-473 24 p. |
artikel |
||
| 54 | Temporal logics with incommensurable distances are undecidable |
Rabinovich, Alexander |
2007 |
5 |
p. 707-715 9 p. |
artikel |
||
| 55 | Termination of just/fair computations in term rewriting |
Lucas, Salvador |
2008 |
5 |
p. 652-675 24 p. |
artikel |
||
| 56 | The boolean hierarchy of NP-partitions |
Kosub, Sven |
2008 |
5 |
p. 538-568 31 p. |
artikel |
||
| 57 | The perfectly synchronized round-based model of distributed computing |
Delporte-Gallet, Carole |
2007 |
5 |
p. 783-815 33 p. |
artikel |
||
| 58 | 20th International Conference on Concurrency Theory |
2011 |
5 |
p. 765- 1 p. |
artikel |
|||
| 59 | Towards a dichotomy theorem for the counting constraint satisfaction problem |
Bulatov, Andrei A. |
2007 |
5 |
p. 651-678 28 p. |
artikel |
||
| 60 | Trees with exponentially growing costs |
Schulz, Frank |
2008 |
5 |
p. 569-578 10 p. |
artikel |
||
| 61 | Unfolding semantics of graph transformation |
Baldan, Paolo |
2007 |
5 |
p. 733-782 50 p. |
artikel |
||
| 62 | Weakly complete axiomatization of exogenous quantum propositional logic |
Mateus, P. |
2006 |
5 |
p. 771-794 24 p. |
artikel |
||
| 63 | Weighted path queries on semistructured databases |
Flesca, Sergio |
2006 |
5 |
p. 679-696 18 p. |
artikel |
||
| 64 | When unlearning helps |
Baliga, Ganesh |
2008 |
5 |
p. 694-709 16 p. |
artikel |
64 gevonden resultaten