Volume 2010, 2010
- Marats Golovkins, Jean-Eric Pin: Varieties Generated by Certain Models of Reversible Finite Automata.
- Martin Tancer: d-collapsibility is NP-complete for d greater or equal to 4.
- David A. Meyer, James Pommersheim: Single-Query Learning from Abelian and Non-Abelian Hamming Distance Oracles.
- Adam R. Day: On Process Complexity.
- András Faragó: On the Structure of Classes of Random Graphs.
- David J. Pearce, Gary Haggard, Gordon Royle: Edge-Selection Heuristics for Computing Tutte Polynomials.
- Wataru Matsubara, Shunsuke Inenaga, Ayumi Shinohara: An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Balanced Straight Line Programs.
- Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar: Longest Paths in Planar DAGs in Unambiguous Log-Space.
- Koji Nakazawa, Makoto Tatsuta: Type Checking and Inference for Polymorphic and Existential Types in Multiple-Quantifier and Type-Free Systems.
- Kevin Henshall, Peter Schachte, Harald Søndergaard, Leigh Whiting: An Algorithm for Affine Approximation of Binary Decision Diagrams.
- Sumit Ganguly: Distributing Frequency-Dependent Data Stream Computations.
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T203413 by the dblp team