Skip to Navigation
Skip to Content
 
Home> Mathematical Structures in Computer Science> Vol. 19 Special Issue 01

 

Log In

Browse Journals

Special Sales

Cambridge Journals Digital Archive

Click here for details about our archive digitisation project. more details

2009 Journals Catalogue

Click here to download a PDF of our latest catalogue; a comprehensive guide to all of our journals. more details

CJO Now Includes:

568,935 articles from 321 leading journals.

Customize Your Search Toolbar

Mathematical Structures in Computer Science

Search

Social Bookmarking

  • Note: Abstract, PDF and HTML open in a new window

  • Editor(s):
  • G. Longo, CNRS and Ecole Normale Supérieure, Paris, France

Sort by

Previous Issue Next Issue

Table of Contents - Volume 19 - Special Issue 01 (Theory and Applications of Models of Computation (TAMC))  

  Please select Articles below or use Select All, then click the appropriate button above. Select/Deselect All:
 

Front Cover (OFC, IFC) and matter

 
Free access

MSC volume 19 issue 1 Cover and Front matter

Mathematical Structures in Computer Science, Volume 19, Special Issue 01, February 2009, pp f1-f2
doi:10.1017/S0960129508007408 (About doi), Published Online by Cambridge University Press 20 Feb 2009
 

Back Cover (IBC, OBC) and matter

 
Free access

MSC volume 19 issue 1 Cover and Back matter

Mathematical Structures in Computer Science, Volume 19, Special Issue 01, February 2009, pp b1-b11
doi:10.1017/S0960129509007452 (About doi), Published Online by Cambridge University Press 20 Feb 2009
 

Introduction

 
Free access

Editors' note: bibliometrics and the curators of orthodoxy

MSCS Editorial Board

Mathematical Structures in Computer Science, Volume 19, Special Issue 01, February 2009, pp 1-4
doi:10.1017/S0960129508007391 (About doi), Published Online by Cambridge University Press 19 Jan 2009
 

Editorial Preface

 
Free access

Preface to Special Issue: Theory and Applications of Models of Computation (TAMC)

JIN-YI CAI, S. BARRY COOPER and ANGSHENG LI

Mathematical Structures in Computer Science, Volume 19, Special Issue 01, February 2009, pp 5-7
doi:10.1017/S0960129508007214 (About doi), Published Online by Cambridge University Press 20 Feb 2009
 

Paper

 
Free access

Phase transition of multivariate polynomial systems

GIORDANO FUSCO and ERIC BACH

Mathematical Structures in Computer Science, Volume 19, Special Issue 01, February 2009, pp 9-23
doi:10.1017/S0960129508007251 (About doi), Published Online by Cambridge University Press 20 Feb 2009
Free access

Non-cupping, measure and computably enumerable splittings

GEORGE BARMPALIAS and ANTHONY MORPHETT

Mathematical Structures in Computer Science, Volume 19, Special Issue 01, February 2009, pp 25-43
doi:10.1017/S0960129508007226 (About doi), Published Online by Cambridge University Press 20 Feb 2009
Free access

On universal computably enumerable prefix codes

CRISTIAN S. CALUDE and LUDWIG STAIGER

Mathematical Structures in Computer Science, Volume 19, Special Issue 01, February 2009, pp 45-57
doi:10.1017/S0960129508007238 (About doi), Published Online by Cambridge University Press 20 Feb 2009
Free access

Absolutely non-computable predicates and functions in analysis

KLAUS WEIHRAUCH, YONGCHENG WU and DECHENG DING

Mathematical Structures in Computer Science, Volume 19, Special Issue 01, February 2009, pp 59-71
doi:10.1017/S096012950800724X (About doi), Published Online by Cambridge University Press 20 Feb 2009
Free access

Complexity of propositional projection temporal logic with star

CONG TIAN and ZHENHUA DUAN

Mathematical Structures in Computer Science, Volume 19, Special Issue 01, February 2009, pp 73-100
doi:10.1017/S096012950800738X (About doi), Published Online by Cambridge University Press 20 Feb 2009
Free access

On computably locally compact Hausdorff spaces

YATAO XU and TANJA GRUBBA

Mathematical Structures in Computer Science, Volume 19, Special Issue 01, February 2009, pp 101-117
doi:10.1017/S0960129508007366 (About doi), Published Online by Cambridge University Press 20 Feb 2009
Free access

Quantum multiparty communication complexity and circuit lower bounds

IORDANIS KERENIDIS

Mathematical Structures in Computer Science, Volume 19, Special Issue 01, February 2009, pp 119-132
doi:10.1017/S0960129508007263 (About doi), Published Online by Cambridge University Press 20 Feb 2009
Free access

Unary automatic graphs: an algorithmic perspective

BAKHADYR KHOUSSAINOV, JIAMOU LIU and MIA MINNES

Mathematical Structures in Computer Science, Volume 19, Special Issue 01, February 2009, pp 133-152
doi:10.1017/S0960129508007342 (About doi), Published Online by Cambridge University Press 20 Feb 2009
Free access

Principal filters definable by parameters in xs1D4D4bT

ANGSHENG LI, WEILIN LI, YICHENG PAN and LINQING TANG

Mathematical Structures in Computer Science, Volume 19, Special Issue 01, February 2009, pp 153-167
doi:10.1017/S0960129508007354 (About doi), Published Online by Cambridge University Press 20 Feb 2009
Free access

Cupping Δ20 enumeration degrees to 0 e′

MARIYA IVANOVA SOSKOVA and GUOHUA WU

Mathematical Structures in Computer Science, Volume 19, Special Issue 01, February 2009, pp 169-191
doi:10.1017/S0960129508007378 (About doi), Published Online by Cambridge University Press 20 Feb 2009
Free access

A note on the feasibility of generalised universal composability

ANDREW C. C. YAO, FRANCES F. YAO and YUNLEI ZHAO

Mathematical Structures in Computer Science, Volume 19, Special Issue 01, February 2009, pp 193-205
doi:10.1017/S0960129508007330 (About doi), Published Online by Cambridge University Press 20 Feb 2009
Free access

The method of the Yu–Ding Theorem and its application

YUN FAN

Mathematical Structures in Computer Science, Volume 19, Special Issue 01, February 2009, pp 207-215
doi:10.1017/S0960129508007275 (About doi), Published Online by Cambridge University Press 20 Feb 2009
  Please select Articles above or use Select All, then click the appropriate button below. Select/Deselect All:

Sort by

Cambridge University Press