default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Computer and System Sciences, Volume 109
Volume 109, May 2020
- Florian Bridoux, Alonso Castillo-Ramirez
, Maximilien Gadouleau:
Complete simulation of automata networks. 1-21 - Petr Jancar:
Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence. 22-44 - Sudeshna Kolay, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh:
Faster Graph bipartization. 45-55 - Julien Baste, Ignasi Sau, Dimitrios M. Thilikos:
Hitting minors on bounded treewidth graphs. III. Lower bounds. 56-77 - Hu Ding, Jinhui Xu:
Learning the truth vector in high dimensions. 78-94 - Miriam Backens, Andrei Bulatov, Leslie Ann Goldberg, Colin McQuillan, Stanislav Zivný:
Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin. 95-125 - Karolina Okrasa, Pawel Rzazewski:
Subexponential algorithms for variants of the homomorphism problem in string graphs. 126-144
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-10-25 20:03 CEST 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:
