CSR 2008:
Moscow,
Russia
Edward A. Hirsch, Alexander A. Razborov, Alexei L. Semenov, Anatol Slissenko (Eds.):
Computer Science - Theory and Applications, Third International Computer Science Symposium in Russia, CSR 2008, Moscow, Russia, June 7-12, 2008, Proceedings.
Lecture Notes in Computer Science 5010 Springer 2008, ISBN 978-3-540-79708-1 BibTeX
Opening Lecture
Invited Papers
Theory Track
- Sergei N. Artëmov, Elena Nogina:
Topological Semantics of Justification Logic.
30-39
Electronic Edition (link) BibTeX
- Vikraman Arvind, Bireswar Das, Johannes Köbler:
A Logspace Algorithm for Partial 2-Tree Canonization.
40-51
Electronic Edition (link) BibTeX
- Arnon Avron, Anna Zamansky:
A Triple Correspondence in Canonical Calculi: Strong Cut-Elimination, Coherence, and Non-deterministic Semantics.
52-63
Electronic Edition (link) BibTeX
- Maxim A. Babenko, Tatiana A. Starikovskaya:
Computing Longest Common Substrings Via Suffix Arrays.
64-75
Electronic Edition (link) BibTeX
- Nicolas Bedon, Alexis Bès, Olivier Carton, Chloe Rispal:
Logic and Rational Languages of Words Indexed by Linear Orderings.
76-85
Electronic Edition (link) BibTeX
- Markus Bläser, Holger Dell, Johann A. Makowsky:
Complexity of the Bollobás-Riordan Polynomial.
86-98
Electronic Edition (link) BibTeX
- Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Vladimir Oudalov:
A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames.
99-109
Electronic Edition (link) BibTeX
- Didier Caucal, Stéphane Hassen:
Synchronization of Grammars.
110-121
Electronic Edition (link) BibTeX
- Dmitriy Yu. Cherukhin:
Lower Bounds for Depth-2 and Depth-3 Boolean Circuits with Arbitrary Gates.
122-133
Electronic Edition (link) BibTeX
- Ugo Dal Lago, Martin Hofmann:
A Semantic Proof of Polytime Soundness of Light Affine Logic.
134-145
Electronic Edition (link) BibTeX
- Rostislav Deviatov:
On Subword Complexity of Morphic Sequences.
146-157
Electronic Edition (link) BibTeX
- Jirí Fiala, Daniël Paulusma:
Comparing Universal Covers in Polynomial Time.
158-167
Electronic Edition (link) BibTeX
- Melvin Fitting:
S4LPand Local Realizability.
168-179
Electronic Edition (link) BibTeX
- Uffe Flarup, Laurent Lyaudet:
On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract).
180-193
Electronic Edition (link) BibTeX
- Enrico Formenti, Jarkko Kari, Siamak Taati:
The Most General Conservation Law for a Cellular Automaton.
194-203
Electronic Edition (link) BibTeX
- Sumit Ganguly:
Lower Bounds on Frequency Estimation of Data Streams (Extended Abstract).
204-215
Electronic Edition (link) BibTeX
- Johannes Köbler, Oleg Verbitsky:
From Invariants to Canonization in Parallel.
216-227
Electronic Edition (link) BibTeX
- Roman Kuznets:
Self-referentiality of Justified Knowledge.
228-239
Electronic Edition (link) BibTeX
- Nutan Limaye, Meena Mahajan, Antoine Meyer:
On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata.
240-251
Electronic Edition (link) BibTeX
- Denis Osin, Vladimir Shpilrain:
Public Key Encryption and Encryption Emulation Attacks.
252-260
Electronic Edition (link) BibTeX
- Vladimir V. Podolskii:
A Uniform Lower Bound on Weights of Perceptrons.
261-272
Electronic Edition (link) BibTeX
- Yury Savateev:
Lambek Grammars with One Division Are Decidable in Polynomial Time.
273-282
Electronic Edition (link) BibTeX
- Vladimir Shpilrain:
Cryptanalysis of Stickel's Key Exchange Scheme.
283-288
Electronic Edition (link) BibTeX
- Arseny M. Shur:
Combinatorial Complexity of Regular Languages.
289-301
Electronic Edition (link) BibTeX
- Vladimir V. V'yugin:
On Sequences with Non-learnable Subsequences.
302-313
Electronic Edition (link) BibTeX
- Mingyu Xiao:
Algorithms for Multiterminal Cuts.
314-325
Electronic Edition (link) BibTeX
- Marius Zimand:
Two Sources Are Better Than One for Increasing the Kolmogorov Complexity of Infinite Sequences.
326-338
Electronic Edition (link) BibTeX
Applications and Technology Track
- Yevgeniy Bodyanskiy, Sergiy Popov, Taras Rybalchenko:
Multilayer Neuro-fuzzy Network for Short Term Electric Load Forecasting.
339-348
Electronic Edition (link) BibTeX
- Laura Kovács:
Invariant Generation for P-Solvable Loops with Assignments.
349-359
Electronic Edition (link) BibTeX
- Valery A. Nepomniaschy, Dmitri M. Beloglazov, Tatiana G. Churina, Mikhail Mashukov:
Using Coloured Petri Nets to Model and Verify Telecommunications Systems.
360-371
Electronic Edition (link) BibTeX
- Victor Y. Pan, Dmitriy Ivolgin, Brian Murphy, Rhys Eric Rosholt, Yuqing Tang, Xiaodong Yan:
Additive Preconditioning for Matrix Computations.
372-383
Electronic Edition (link) BibTeX
- Dusko Pavlovic:
Network as a Computer: Ranking Paths to Find Flows.
384-397
Electronic Edition (link) BibTeX
- Maxime Rebout, Louis Féraud, Sergei Soloviev:
A Unified Categorical Approach for Attributed Graph Rewriting.
398-409
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:04:16 2009
by Michael Ley (ley@uni-trier.de)