Journal: Theory Comput. Syst.

Volume 58, Issue 4

503 -- 505Anca Muscholl, Martin Dietzfelbinger. Preface of STACS 2013 Special Issue
506 -- 527Florent Capelli, Arnaud Durand 0001, Stefan Mengel. The Arithmetic Complexity of Tensor Contraction
528 -- 578Julien Clément 0001, James Allen Fill, Thu Hien Nguyen Thi, Brigitte Vallée. Towards a Realistic Analysis of the QuickSelect Algorithm
579 -- 613Thomas Colcombet, Laure Daviaud. Approximate Comparison of Functions Computed by Distance Automata
614 -- 663Tomasz Idziaszek, Michal Skrzypczak, Mikolaj Bojanczyk. Regular Languages of Thin Trees
664 -- 680Ines Klimann. Automaton Semigroups: The Two-state Case
681 -- 706Tengyu Ma, Bo Tang 0003, Yajun Wang. The Simulated Greedy Algorithm for Several Submodular Matroid Secretary Problems