default search action
Theoretical Computer Science, Volume 590
Volume 590, July 2015
- Leszek Gasieniec, Russell Martin, Frank Wolter, Prudence W. H. Wong:
Fundamentals of Computation Theory. 1
- Tatsuya Akutsu, Takeyuki Tamura, Avraham A. Melkman, Atsuhiro Takasu:
On the complexity of finding a largest common subtree of bounded degree. 2-16 - Joan Boyar, Magnus Gausdal Find:
Cancellation-free circuits in unbounded and bounded depth. 17-26 - Arnaud Casteigts, Paola Flocchini, Emmanuel Godard, Nicola Santoro, Masafumi Yamashita:
On the expressivity of time-varying graphs. 27-37 - Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan, Yadu Vasudev:
On the isomorphism problem for decision trees and decision lists. 38-54 - Evangelos Kranakis, Fraser MacQuarrie, Oscar Morales-Ponce:
Connectivity and stretch factor trade-offs in wireless sensor networks with directional antennae. 55-72 - Miroslaw Kowaluk, Gabriela Majewska:
New sequential and parallel algorithms for computing the β-spectrum. 73-85 - Steven Chaplick, Jirí Fiala, Pim van 't Hof, Daniël Paulusma, Marek Tesar:
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree. 86-95 - Sotiris E. Nikoletseas, Panagiota N. Panagopoulou, Christoforos L. Raptopoulos, Paul G. Spirakis:
On the structure of equilibria in basic network formation. 96-105 - Neta Barkay, Ely Porat, Bar Shalem:
Efficient sampling of non-strict turnstile data streams. 106-117 - Kewen Liao, Hong Shen, Longkun Guo:
Improved approximation algorithms for constrained fault-tolerant resource allocation. 118-128 - Antonio Fernández Anta, Chryssis Georgiou, Dariusz R. Kowalski, Elli Zavou:
Online parallel scheduling of non-uniform tasks: Trading failures for energy. 129-146
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.