default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChicago Journal of Theoretical Computer Science, 2010
Volume 2010, 2010
- Ashley Montanaro, Tobias Osborne:
Quantum boolean functions. - 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 F. 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. - Mark Utting, Petra Malik, Ian Toyn:
Transformation Rules for Z. - 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.
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.
last updated on 2024-12-01 00:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
