Regular Languages of Thin Trees.
- Published in:
- Theory of Computing Systems, 2016, v. 58, n. 4, p. 614, doi. 10.1007/s00224-014-9595-z
- By:
- Publication type:
- Article
Works matching IS 14324350 AND DT 2016 AND VI 58 AND IP 4
Results: 7
1
2
The Arithmetic Complexity of Tensor Contraction.
- Published in:
- Theory of Computing Systems, 2016, v. 58, n. 4, p. 506, doi. 10.1007/s00224-015-9630-8
- By:
- Publication type:
- Article
3
Towards a Realistic Analysis of the QuickSelect Algorithm.
- Published in:
- Theory of Computing Systems, 2016, v. 58, n. 4, p. 528, doi. 10.1007/s00224-015-9633-5
- By:
- Publication type:
- Article
4
The Simulated Greedy Algorithm for Several Submodular Matroid Secretary Problems.
- Published in:
- Theory of Computing Systems, 2016, v. 58, n. 4, p. 681, doi. 10.1007/s00224-015-9642-4
- By:
- Publication type:
- Article
5
Approximate Comparison of Functions Computed by Distance Automata.
- Published in:
- Theory of Computing Systems, 2016, v. 58, n. 4, p. 579, doi. 10.1007/s00224-015-9643-3
- By:
- Publication type:
- Article
6
Preface of STACS 2013 Special Issue.
- Published in:
- 2016
- By:
- Publication type:
- Editorial
7
Automaton Semigroups: The Two-state Case.
- Published in:
- Theory of Computing Systems, 2016, v. 58, n. 4, p. 664, doi. 10.1007/s00224-014-9594-0
- By:
- Publication type:
- Article