Information and Computation, Volume 224

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

> Home > Journals > Information and Computation

Volume 224, March 2013

- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/iandc/BonnetFHR13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/BonnetFHR13
Rémi Bonnet, Alain Finkel, Serge Haddad, Fernando Rosa-Velardo:
Ordinal theory for expressiveness of well-structured transition systems. 1-22
- view
  - electronic edition via DOI (open access)
  - references & citations
- export record
  dblp key:
  - journals/iandc/EdalatLP13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/EdalatLP13
Abbas Edalat, André Lieutier, Dirk Pattinson:
A computational model for multi-variable differential calculus. 23-45
- view
  - electronic edition via DOI (open access)
  - references & citations
- export record
  dblp key:
  - journals/iandc/BrazdilFKKK13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/BrazdilFKKK13
Tomás Brázdil, Vojtech Forejt, Jan Krcál, Jan Kretínský, Antonín Kucera:
Continuous-time stochastic games with time-bounded reachability. 46-70
- view
  - electronic edition via DOI (open access)
  - references & citations
- export record
  dblp key:
  - journals/iandc/LohreyM13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/LohreyM13
Markus Lohrey, Christian Mathissen:
Isomorphism of regular trees and words. 71-105

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.