Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarCSR 2009: Novosibirsk, Russia
Anna E. Frid, Andrey Morozov, Andrey Rybalchenko, Klaus W. Wagner:
Computer Science - Theory and Applications, Fourth International Computer Science Symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18-23, 2009. Proceedings. Lecture Notes in Computer Science 5675, Springer 2009, ISBN 978-3-642-03350-6
Invited Papers
Pedro Cabalar, Sergei P. Odintsov, David Pearce:
Well-Founded and Partial Stable Semantics Logical Aspects. 1-11Wolfgang Thomas:
The Reachability Problem over Infinite Graphs. 12-18Nikolay K. Vereshchagin:
Kolmogorov Complexity and Model Selection. 19-24Hongseok Yang:
Automatic Verification of Heap-Manipulating Programs Using Separation Logic. 25
Accepted Papers
Arnon Avron, Agata Ciabattoni, Anna Zamansky:
Canonical Calculi: Invertibility, Axiom Expansion and (Non)-determinism. 26-37Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko:
Integrality Property in Preemptive Parallel Machine Scheduling. 38-46Olaf Beyersdorff, Zenon Sadowski:
Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes. 47-58Chris Calabro, Ramamohan Paturi:
k-SAT Is No Harder Than Decision-Unique-k-SAT. 59-70Christian Choffrut, Juhani Karhumäki:
Unique Decipherability in the Monoid of Languages: An Application of Rational Relations. 71-79Yi Deng, Giovanni Di Crescenzo, Dongdai Lin, Dengguo Feng:
Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model. 80-91Tommy Färnqvist, Peter Jonsson, Johan Thapper:
Approximability Distance in the Space of H-Colourability Problems. 92-104Andreas Goerdt:
On Random Ordering Constraints. 105-116Kristoffer Arnsfelt Hansen:
Depth Reduction for Circuits with a Single Layer of Modular Counting Gates. 117-128Edward A. Hirsch, Sergey I. Nikolenko:
A Feebly Secure Trapdoor Function. 129-142Pim van 't Hof, Daniël Paulusma, Gerhard J. Woeginger:
Partitioning Graphs into Connected Parts. 143-154Dmitry Itsykson:
Structural Complexity of AvgBPP. 155-166Maurice J. Jansen:
Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials. 167-178Maurice J. Jansen, B. V. Raghavendra Rao:
Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity. 179-190Artur Jez, Alexander Okhotin:
One-Nonterminal Conjunctive Grammars over a Unary Alphabet. 191-202Galina Jirásková:
Concatenation of Regular Languages and Descriptional Complexity. 203-214Peter Jonsson, Johan Thapper:
Approximability of the Maximum Solution Problem for Certain Families of Algebras. 215-226Alexander V. Kononov, Sergey Sevastyanov, Maxim Sviridenko:
Complete Complexity Classification of Short Shop Scheduling. 227-236Niko Haubold, Markus Lohrey:
Compressed Word Problems in HNN-Extensions and Amalgamated Products. 237-249Daniil Musatov, Andrei E. Romashchenko, Alexander Shen:
Variations on Muchnik's Conditional Complexity Theorem. 250-262Ely Porat:
An Optimal Bloom Filter Replacement Based on Matrix Solving. 263-273Yuri Pritykin, Julya Ulyashkina:
Aperiodicity Measure for Infinite Sequences. 274-285B. V. Raghavendra Rao, Jayalal Sarma:
On the Complexity of Matroid Isomorphism Problems. 286-298Dogan Kesdogan, Daniel Mölle, Stefan Richter, Peter Rossmanith:
Breaking Anonymity by Learning a Unique Minimum Hitting Set. 299-309Neeldhara Misra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
The Budgeted Unique Coverage Problem and Color-Coding. 310-321Mark A. Hillebrand, Sergey Tverdyshev:
Formal Verification of Gate-Level Computer Systems. 322-333Mikhail N. Vyalyi:
On Models of a Nondeterministic Computation. 334-345Magnus Wahlström:
New Plain-Exponential Time Classes for Graph Homomorphism. 346-355Abuzer Yakaryilmaz, A. C. Cem Say:
Languages Recognized with Unbounded Error by Quantum Finite Automata. 356-367
last updated on 2019-10-14 23:05 CEST by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
