zbMATH — the first resource for mathematics

Computer science – theory and applications. Third international computer science symposium in Russia, CSR 2008 Moscow, Russia, June 7–12, 2008. Proceedings. (English) Zbl 1136.68005
Lecture Notes in Computer Science 5010. Berlin: Springer (ISBN 978-3-540-79708-1/pbk). xiii, 411 p. (2008).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. The preceding symposium has been reviewed (see Zbl 1135.68001).
Indexed articles:
Wigderson, Avi, Randomness – a computational complexity perspective, 1-2 [Zbl 1142.68357]
Allender, Eric, Cracks in the defenses: Scouting out approaches on circuit lower bounds, 3-10 [Zbl 1142.68363]
Khasidashvili, Zurab, On formal equivalence verification of hardware, 11-12 [Zbl 1142.68436]
Pudlák, Pavel, Twelve problems in proof complexity, 13-27 [Zbl 1142.03369]
Artemov, Sergei; Nogina, Elena, Topological semantics of justification logic, 30-39 [Zbl 1138.03015]
Arvind, Vikraman; Das, Bireswar; Köbler, Johannes, A logspace algorithm for partial 2-tree canonization, 40-51 [Zbl 1142.68368]
Avron, Arnon; Zamansky, Anna, A triple correspondence in canonical calculi: Strong cut-elimination, coherence, and non-deterministic semantics, 52-63 [Zbl 1143.03028]
Babenko, Maxim A.; Starikovskaya, Tatiana A., Computing longest common substrings via suffix arrays, 64-75 [Zbl 1142.68592]
Bedon, Nicolas; Bès, Alexis; Carton, Olivier; Rispal, Chloé, Logic and rational languages of words indexed by linear orderings, 76-85 [Zbl 1142.03346]
Bläser, Markus; Dell, Holger; Makowsky, Johann A., Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions, 86-98 [Zbl 1143.05023]
Boros, Endre; Elbassioni, Khaled; Gurvich, Vladimir; Makino, Kazuhisa; Oudalov, Vladimir, A complete characterization of Nash-solvability of bimatrix games in terms of the exclusion of certain \(2\times 2\) subgames, 99-109 [Zbl 1143.91308]
Caucal, Didier; Hassen, Stéphane, Synchronization of grammars, 110-121 [Zbl 1142.68413]
Cherukhin, Dmitriy Yu., Lower bounds for depth-2 and depth-3 Boolean circuits with arbitrary gates, 122-133 [Zbl 1142.68364]
Lago, Ugo Dal; Hofmann, Martin, A semantic proof of polytime soundness of light affine logic, 134-145 [Zbl 1142.68360]
Deviatov, Rostislav, On subword complexity of morphic sequences, 146-157 [Zbl 1142.68464]
Fiala, Jiří; Paulusma, Daniël, Comparing universal covers in polynomial time, 158-167 [Zbl 1142.68456]
Fitting, Melvin, S4LP and local realizability, 168-179 [Zbl 1143.03009]
Flarup, Uffe; Lyaudet, Laurent, On the expressive power of permanents and perfect matchings of matrices of bounded pathwidth/cliquewidth (extended abstract), 180-193 [Zbl 1142.68350]
Formenti, Enrico; Kari, Jarkko; Taati, Siamak, The most general conservation law for a cellular automaton, 194-203 [Zbl 1142.68443]
Ganguly, Sumit, Lower bounds on frequency estimation of data streams (extended abstract), 204-215 [Zbl 1142.68331]
Köbler, Johannes; Verbitsky, Oleg, From invariants to canonization in parallel, 216-227 [Zbl 1142.68354]
Kuznets, Roman, Self-referentiality of justified knowledge, 228-239 [Zbl 1143.03010]
Limaye, Nutan; Mahajan, Meena; Meyer, Antoine, On the complexity of membership and counting in height-deterministic pushdown automata, 240-251 [Zbl 1142.68424]
Osin, Denis; Shpilrain, Vladimir, Public key encryption and encryption emulation attacks, 252-260 [Zbl 1142.94356]
Podolskii, Vladimir V., A uniform lower bound on weights of perceptrons, 261-272 [Zbl 1142.94400]
Savateev, Yury, Lambek grammars with one division are decidable in polynomial time, 273-282 [Zbl 1142.68415]
Shpilrain, Vladimir, Cryptanalysis of Stickel’s key exchange scheme, 283-288 [Zbl 1142.94360]
Shur, Arseny M., Combinatorial complexity of regular languages, 289-301 [Zbl 1142.68428]
V’yugin, Vladimir V., On sequences with non-learnable subsequences, 302-313 [Zbl 1142.68410]
Xiao, Mingyu, Algorithms for multiterminal cuts, 314-325 [Zbl 1142.68462]
Zimand, Marius, Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences, 326-338 [Zbl 1143.68020]
Bodyanskiy, Yevgeniy; Popov, Sergiy; Rybalchenko, Taras, Multilayer neuro-fuzzy network for short term electric load forecasting, 339-348 [Zbl 1142.68468]
Kovács, Laura, Invariant generation for P-solvable loops with assignments, 349-359 [Zbl 1142.68619]
Pan, Victor Y.; Ivolgin, Dmitriy; Murphy, Brian; Rosholt, Rhys Eric; Tang, Yuqing; Yan, Xiaodong, Additive preconditioning for matrix computations, 372-383 [Zbl 1142.68607]
Pavlovic, Dusko, Network as a computer: Ranking paths to find flows, 384-397 [Zbl 1142.68316]
Rebout, Maxime; Féraud, Louis; Soloviev, Sergei, A unified categorical approach for attributed graph rewriting, 398-409 [Zbl 1142.68414]

68-06 Proceedings, conferences, collections, etc. pertaining to computer science
68Qxx Theory of computing
00B25 Proceedings of conferences of miscellaneous specific interest
Full Text: DOI