default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Structures in Computer Science, Volume 19
Volume 19, Number 1, February 2009
- Editors' note: bibliometrics and the curators of orthodoxy. 1-4
- Jin-yi Cai, S. Barry Cooper, Angsheng Li:
Preface to Special Issue: Theory and Applications of Models of Computation (TAMC). 5-7 - Giordano Fusco, Eric Bach:
Phase transition of multivariate polynomial systems. 9-23 - George Barmpalias
, Anthony Morphett:
Non-cupping, measure and computably enumerable splittings. 25-43 - Cristian S. Calude, Ludwig Staiger:
On universal computably enumerable prefix codes. 45-57 - Klaus Weihrauch, Yongcheng Wu, Decheng Ding:
Absolutely non-computable predicates and functions in analysis. 59-71 - Cong Tian, Zhenhua Duan:
Complexity of propositional projection temporal logic with star. 73-100 - Yatao Xu, Tanja Grubba:
On computably locally compact Hausdorff spaces. 101-117 - Iordanis Kerenidis:
Quantum multiparty communication complexity and circuit lower bounds. 119-132 - Bakhadyr Khoussainov, Jiamou Liu, Mia Minnes:
Unary automatic graphs: an algorithmic perspective. 133-152 - Angsheng Li, Weilin Li, Yicheng Pan, Linqing Tang:
Principal filters definable by parameters in EbT. 153-167 - Mariya Ivanova Soskova, Guohua Wu:
Cupping Delta20 enumeration degrees to 0 e'. 169-191 - Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao:
A note on the feasibility of generalised universal composability. 193-205 - Yun Fan:
The method of the Yu-Ding Theorem and its application. 207-215
Volume 19, Number 2, April 2009
- Masahito Hasegawa:
On traced monoidal closed categories. 217-244 - Annegret Habel, Karl-Heinz Pennemann:
Correctness of high-level transformation systems relative to nested conditions. 245-296 - Ugo Dal Lago, Andrea Masini, Margherita Zorzi:
On a measurement-free quantum lambda calculus with classical control. 297-335 - M. Ali-Akbari, Bijan Honari, Massoud Pourmahdian, M. M. Rezaii:
The space of formal balls and models of quasi-metric spaces. 337-355 - J. Robin B. Cockett, Ernie Manes:
Boolean and classical restriction categories. 357-416 - Benno van den Berg:
Three extensional models of type theory. 417-434
Volume 19, Number 3, June 2009
- Dominique Larchey-Wendling, Didier Galmiche:
Exploring the relation between Intuitionistic BI and Boolean BI: an unexpected embedding. 435-500 - Klaus Keimel, Gordon D. Plotkin:
Predicate transformers for extended probability and non-determinism. 501-539 - Salvador Romaguera, Óscar Valero:
A quantitative computational model for complete partial metric spaces via formal balls. 541-563 - Mario Bravetti, Gianluigi Zavattaro:
On the expressive power of process interruption and compensation. 565-599 - Mario Bravetti, Gianluigi Zavattaro:
A theory of contracts for strong service compliance. 601-638
Volume 19, Number 4, August 2009
- Rasmus Ejlers Møgelberg:
From parametric polymorphism to models of polymorphic FPC. 639-686 - Richard Garner:
Two-dimensional models of type theory. 687-736 - Yun Shang, Xian Lu, Ruqian Lu:
Automata theory based on unsharp quantum logic. 737-756 - Andrej Bauer, Paul Taylor:
The Dedekind reals in abstract Stone duality. 757-838 - Michele Bugliesi, Dario Colazzo, Silvia Crafa, Damiano Macedonio:
A type system for Discretionary Access Control. 839-875
Volume 19, Number 5, October 2009
- Andrea Asperti, Herman Geuvers, Raja Natarajan:
Social processes, program verification and all that. 877-896 - Chantal Berline, Giulio Manzonetto, Antonino Salibra:
Effective lambda-models versus recursively enumerable lambda-theories. 897-942 - Matthias Schröder:
The sequential topology on ℕℕℕ is not regular. 943-957 - Matthew Collinson, David J. Pym:
Algebra and logic for resource-based systems modelling. 959-1027 - Lionel Vaux:
The algebraic lambda calculus. 1029-1059
Volume 19, Number 6, December 2009
- Luca Aceto, Anna Ingólfsdóttir:
Foreword: special issue in memory of Nadia Busi. 1061-1063 - Nadia Busi, Roberto Gorrieri:
Structural non-interference in elementary and trace nets. 1065-1090 - Nadia Busi, G. Michele Pinna:
Process discovery and Petri nets. 1091-1124 - Nadia Busi, Miguel Angel Gutiérrez-Naranjo, Mario J. Pérez-Jiménez:
Efficient computation in rational-valued P systems. 1125-1139 - Daniela Besozzi, Nadia Busi, Paolo Cazzaniga, Claudio Ferretti, Alberto Leporati, Giancarlo Mauri, Dario Pescini, Claudio Zandron:
(Tissue) P systems with cell polarity. 1141-1160 - Cristian Versari, Nadia Busi, Roberto Gorrieri:
An expressiveness study of priority in process calculi. 1161-1189 - Nadia Busi, Maurizio Gabbrielli, Gianluigi Zavattaro:
On the expressive power of recursion, replication and iteration in process calculi. 1191-1222 - Nadia Busi, Gianluigi Zavattaro:
Deciding reachability problems in Turing-complete fragments of Mobile Ambients. 1223-1263 - Andrea Asperti, Nadia Busi:
Mobile Petri nets. 1265-1278 - Gianluigi Zavattaro:
Nadia Busi's publications. 1279-1284
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-12-04 22:29 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:
