Stop the war!
default search action
Information and Computation, Volume 217
Volume 217, August 2012
- Vikraman Arvind, Bireswar Das, Johannes Köbler, Sebastian Kuhnert:
The isomorphism problem for k-trees is complete for logspace. 1-11
- Volker Diekert, Steffen Kopecki, Victor Mitrana:
Deciding regularity of hairpin completions of regular languages in polynomial time. 12-30
- David I. Spivak:
Functorial data migration. 31-51
- Vasco T. Vasconcelos:
Fundamentals of session types. 52-70
- Bireswar Das, Jacobo Torán, Fabian Wagner:
Restricted space algorithms for isomorphism on bounded treewidth graphs. 71-83
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.