Information and Computation, Volume 217

Volume 217, August 2012

- view
  - electronic edition @ doi.org
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/iandc/ArvindDKK12
- ask others
Vikraman Arvind, Bireswar Das, Johannes Köbler, Sebastian Kuhnert: The isomorphism problem for k-trees is complete for logspace. 1-11
- view
  - electronic edition @ doi.org
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/iandc/DiekertKM12
- ask others
Volker Diekert, Steffen Kopecki, Victor Mitrana: Deciding regularity of hairpin completions of regular languages in polynomial time. 12-30
- view
  - electronic edition @ doi.org
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/iandc/Spivak12
- ask others
David I. Spivak: Functorial data migration. 31-51
- view
  - electronic edition @ doi.org
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/iandc/Vasconcelos12
- ask others
Vasco T. Vasconcelos: Fundamentals of session types. 52-70
- view
  - electronic edition @ doi.org
- export record as
  - BibTeX
  - XML
  dblp key:
  - journals/iandc/DasTW12
- ask others
Bireswar Das, Jacobo Torán, Fabian Wagner: Restricted space algorithms for isomorphism on bounded treewidth graphs. 71-83