default search action
CSR 2019: Novosibirsk, Russia
- René van Bevern, Gregory Kucherov:
Computer Science - Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1-5, 2019, Proceedings. Lecture Notes in Computer Science 11532, Springer 2019, ISBN 978-3-030-19954-8 - Yousef M. Alhamdan
, Alexander V. Kononov
Approximability and Inapproximability for Maximum k-Edge-Colored Clustering Problem. 1-12 - Eric Allender
The Non-hardness of Approximating Circuit Size. 13-24 - Elena Arseneva, Prosenjit Bose, Jean-Lou De Carufel, Sander Verdonschot:
Reconstructing a Convex Polygon from Its \omega ω -cloud. 25-37 - Mahdi Belbasi
A Space-Efficient Parameterized Algorithm for the Hamiltonian Cycle Problem by Dynamic Algebraization. 38-49 - Aleksandrs Belovs:
Quantum Algorithm for Distribution-Free Junta Testing. 50-59 - Václav Blazej, Pavel Dvorák
On Induced Online Ramsey Number of Paths, Cycles, and Trees. 60-69 - Vladimir Braverman:
Approximations of Schatten Norms via Taylor Expansions. 70-79 - Bireswar Das, Shivdutt Sharma
Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes. 80-92 - Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman:
Belga B-Trees. 93-105 - Francesco Dolce
Eventually Dendric Shifts. 106-118 - Sergey M. Dudakov
On Decidability of Regular Languages Theories. 119-130 - Kshitij Gajjar
Minimizing Branching Vertices in Distance-Preserving Subgraphs. 131-142 - Ludmila Glinskih, Dmitry Itsykson:
On Tseitin Formulas, Read-Once Branching Programs and Treewidth. 143-155 - Andreas Goerdt:
Matched Instances of Quantum Satisfiability (QSat) - Product State Solutions of Restrictions. 156-167 - Svyatoslav Gryaznov
Notes on Resolution over Linear Equations. 168-179 - Pierre Guillon, Emmanuel Jeandel, Jarkko Kari, Pascal Vanier:
Undecidable Word Problem in Subshift Automorphism Groups. 180-190 - Ashwin Jacob
Parameterized Complexity of Conflict-Free Set Cover. 191-202 - Shmuel Tomi Klein
Forward Looking Huffman Coding. 203-214 - Ivan Koswara, Svetlana Selivanova
Computational Complexity of Real Powering and Improved Solving Linear Differential Equations. 215-227 - Dmitry Kravchenko, Kamil Khadiev
On the Quantum and Classical Complexity of Solving Subtraction Games. 228-236 - Moses Ganardi, Danny Hucke, Markus Lohrey:
Derandomization for Sliding Window Algorithms with Strict Correctness. 237-249 - Jan-Hendrik Lorenz:
On the Complexity of Restarting. 250-261 - Jayakrishnan Madathil, Fahad Panolan
On the Complexity of Mixed Dominating Set. 262-274 - Ruhollah Majdoddin
Uniform CSP Parameterized by Solution Size is in W[1]. 275-285 - Neeldhara Misra, Fahad Panolan
On the Parameterized Complexity of Edge-Linked Paths. 286-298 - Neeldhara Misra, Piyush Rathi:
The Parameterized Complexity of Dominating Set and Friends Revisited for Structured Graphs. 299-310 - Elena A. Petrova
Transition Property for Cube-Free Words. 311-324 - Denis K. Ponomaryov:
A Polynomial Time Delta-Decomposition Algorithm for Positive DNFs. 325-336 - Suthee Ruangwises
Unpopularity Factor in the Marriage and Roommates Problems. 337-348 - Suthee Ruangwises
AND Protocols Using only Uniform Shuffles. 349-358 - Ouri Poupko, Gal Shahaf, Ehud Shapiro, Nimrod Talmon:
Sybil-Resilient Conductance-Based Community Growth. 359-371
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 2025-02-20 00:32 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: