Volume 58, Issue 4 | Theory of Computing Systems

Search all Theory of Computing Systems articles

Volume 58, Issue 4

May 2016

Theoretical Aspects of Computer Science

Issue Editors:

Anca Muscholl,
Martin Dietzfelbinger

7 articles in this issue

Preface of STACS 2013 Special Issue
Anca Muscholl
Martin Dietzfelbinger
EditorialNotes 27 August 2015 Pages: 503 - 505
The Arithmetic Complexity of Tensor Contraction
Florent Capelli
Arnaud Durand
Stefan Mengel
OriginalPaper 14 April 2015 Pages: 506 - 527
Towards a Realistic Analysis of the QuickSelect Algorithm
Julien Clément
James Allen Fill
Brigitte Vallée
OriginalPaper 18 August 2015 Pages: 528 - 578
Approximate Comparison of Functions Computed by Distance Automata
Thomas Colcombet
Laure Daviaud
OriginalPaper 11 July 2015 Pages: 579 - 613
Regular Languages of Thin Trees
Tomasz Idziaszek
Michał Skrzypczak
Mikołaj Bojańczyk
OriginalPaper Open access 08 April 2015 Pages: 614 - 663
Automaton Semigroups: The Two-state Case
Ines Klimann
OriginalPaper 18 November 2014 Pages: 664 - 680
The Simulated Greedy Algorithm for Several Submodular Matroid Secretary Problems
Tengyu Ma
Bo Tang
Yajun Wang
OriginalPaper 07 July 2015 Pages: 681 - 706