default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Structures in Computer Science, Volume 20
Volume 20, Number 1, February 2010
- Thomas T. Hildebrandt, Daniele Gorla
:
Preface to special issue: Expressiveness in Concurrency 2008. 1-2
- Michele Bugliesi, Riccardo Focardi:
Channel abstractions for network security. 3-44 - Luca Cardelli, Gianluigi Zavattaro:
Turing universality of the Biochemical Ground Form. 45-73 - Adam Antonik, Michael Huth, Kim G. Larsen, Ulrik Nyman, Andrzej Wasowski:
Modal and mixed specifications: key decision problems and their complexities. 75-103
Volume 20, Number 2, April 2010
- Bernhard Reus, Achim Jung, Klaus Keimel, Thomas Streicher:
Preface for the special issue on domains. 105-106
- Ulrich Berger, Jens Blanck, Petter Kristian Køber:
Domain representations of spaces of compact subsets. 107-126 - Martín Hötzel Escardó, Paulo Oliva:
Selection functions, bar recursion and backward induction. 127-168 - Jean Goubault-Larrecq:
De Groot duality and models of choice: angels, demons and nature. 169-237 - Martin Hyland:
Some reasons for generalising domain theory. 239-265 - Mateusz Kostanek, Pawel Waszkiewicz:
The limit-colimit coincidence theorem for -categories. 267-284 - Alexander Kurz, Daniela Petrisan:
On universal algebra over nominal sets. 285-318
Volume 20, Number 3, June 2010
- Rocco De Nicola, Daniele Gorla, Anna Labella:
Tree-functors, determinacy and bisimulations. 319-358 - Guram Bezhanishvili, Nick Bezhanishvili, David Gabelaia, Alexander Kurz:
Bitopological duality for distributive lattices and Heyting algebras. 359-393 - Jan A. Bergstra, Cornelis A. Middelburg:
On the operating unit size of load/store architectures. 395-417 - Jirí Adámek, Stefan Milius, Jirí Velebil:
Iterative reflections of monads. 419-452 - Salvador Romaguera, Óscar Valero:
Domain theoretic characterisations of quasi-metric completeness in terms of formal balls. 453-472 - Esfandiar Haghverdi, Philip J. Scott:
Towards a typed Geometry of Interaction. 473-521
Volume 20, Number 4, August 2010
- Kosta Dosen, Zoran Petric:
Coherence for monoidal endofunctors. 523-543 - Kosta Dosen, Zoran Petric:
Coherence for monoidal monads and comonads. 545-561 - Olov Wilander:
Setoids and universes. 563-576 - Gabriele Pulcini:
Rewriting systems for the surface classification theorem. 577-588 - David Cachera, Thomas P. Jensen, Arnaud Jobin, Pascal Sotin:
Long-run cost analysis by approximation of linear operators over dioids. 589-624 - Andrea Meinander:
A solution of the uniform word problem for ortholattices. 625-638 - César Domínguez, Dominique Duval:
Diagrammatic logic applied to a parameterisation process. 639-654 - Lars Birkedal, Kristian Støvring, Jacob Thamsborg:
Realisability semantics of parametric polymorphism, general references and recursive types. 655-703
Volume 20, Number 5, October 2010
- Manindra Agrawal, S. Barry Cooper, Angsheng Li:
Preface to Special Issue: Theory and Applications of Models of Computation (TAMC 2008-2009). 705-706 - Klaus Ambos-Spies, Thorsten Kräling:
Quantitative aspects of speed-up and gap phenomena. 707-722 - Thomas Anberrée:
Semantical proofs of correctness for programs performing non-deterministic tests on real numbers. 723-751 - Mathias Barra:
Bounded minimalisation and bounded counting in argument-bounded idc's. 753-779 - Ernst-Erich Doberkat:
Weak bisimulations for the Giry monad. 781-798 - Andrea Sorbi, Guohua Wu, Yue Yang:
Diamond embeddings into the enumeration degrees. 799-811 - Grégory Lafitte, Michael Weiss:
Tilings: simulation and universality. 813-850 - Minzhu Xie, Jianxin Wang, Jianer Chen:
A practical parameterised algorithm for the individual haplotyping problem MLF. 851-863 - Xiaoxiao Yang, Zhenhua Duan, Qian Ma:
Axiomatic semantics of projection temporal logic programs. 865-914 - Naijun Zhan:
Connection between logical and algebraic approaches to concurrent systems. 915-950 - Yu Zhang:
The computational SLR: a logic for reasoning about computational indistinguishability. 951-975 - Rahul Jain, Ashwin Nayak, Yi Su:
A separation between divergence and Holevo information for ensembles. 977-993
Volume 20, Number 6, December 2010
- Salvador Elías Venegas-Andraca:
Introduction to special issue: Physics and computer science - quantum computation and other approaches. 995-997 - Gonzalo Abal, Raul Donangelo, Franklin L. Marquezino, Renato Portugal:
Spatial search on a honeycomb network. 999-1009 - Cristian S. Calude, Ludwig Staiger:
A note on accelerated Turing machines. 1011-1017 - Edwin J. Beggs, José Félix Costa, John V. Tucker:
Limits to measurement in experiments governed by algorithms. 1019-1050 - Luis-Manuel Rico-Gutierrez, Veiko Palge, Jacob Dunningham:
Observing the superposition of a single particle with the vacuum. 1051-1065 - Hugo Fort, Mordechai Kornbluth, Fredy R. Zypman:
The Travelling Salesman Problem for finite-sized cities. 1067-1078 - Yusuke Ide, Norio Konno:
Continuous-time quantum walks on the threshold network model. 1079-1090 - Norio Konno:
Quantum walks and elliptic integrals. 1091-1098 - Chaobin Liu, Nelson Petulante:
On the von Neumann entropy of certain quantum walks subject to decoherence. 1099-1115 - Marco Lanzagorta, Jeffrey K. Uhlmann:
Quantum algorithmic methods for computational geometry. 1117-1125
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 2025-02-07 23:56 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:
