default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCSR 2007: Ekaterinburg, Russia
- Volker Diekert, Mikhail V. Volkov, Andrei Voronkov:
Computer Science - Theory and Applications, Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings. Lecture Notes in Computer Science 4649, Springer 2007, ISBN 978-3-540-74509-9 - Yuri Gurevich:
Proving Church's Thesis. 1-3 - Scott Aaronson:
The Limits of Quantum Computers. 4 - Rajeev Alur:
Marrying Words and Trees. 5 - Geoff Sutcliffe
:
TPTP, TSTP, CASC, etc. 6-22 - Ziyad Hanna:
Abstract Modeling and Formal Verification of Microprocessors. 23 - Géraud Sénizergues:
Sequences of Level 1, 2, 3, ..., k , ... 24-32 - Bogdan Aman, Gabriel Ciobanu:
Timers and Proximities for Mobile Ambients. 33-43 - Ehsan Amiri, Evgeny S. Skvortsov:
Pushing Random Walk Beyond Golden Ratio. 44-55 - Holger Bock Axelsen, Robert Glück, Tetsuo Yokoyama:
Reversible Machine Code and Its Abstract Processor Architecture. 56-69 - Maxim A. Babenko:
A Fast Algorithm for Path 2-Packing Problem. 70-81 - Danièle Beauquier, Marie Duflot, Yury Lifshits:
Decidability of Parameterized Probabilistic Information Flow. 82-91 - Harry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolai K. Vereshchagin:
Inverting Onto Functions and Polynomial Hierarchy. 92-103 - Dominique Cansell, Dominique Méry:
Proved-Patterns-Based Development for Structured Programs. 104-114 - Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan:
Planarity, Determinants, Permanents, and (Unique) Matchings. 115-126 - Christian Glaßer, Katrin Herr, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr:
Equivalence Problems for Circuits over Sets of Natural Numbers. 127-138 - Victor S. Grishchenko:
Bouillon: A Wiki-Wiki Social Web. 139-145 - Bernhard Heinemann:
A PDL-Like Logic of Knowledge Acquisition. 146-157 - Navid Imani, Hamid Sarbazi-Azad, Selim G. Akl:
Resource Placement in Networks Using Chromatic Sets of Power Graphs. 158-167 - Artur Jez, Alexander Okhotin:
Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth. 168-181 - Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen:
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems. 182-193 - Alexander S. Kulikov, Konstantin Kutzkov:
New Bounds for MAX-SAT by Clause Learning. 194-204 - Mark Sh. Levin:
Towards Hierarchical Clustering (Extended Abstract). 205-215 - Yury Lifshits, Dirk Nowotka:
Estimation of the Click Volume by Large Scale Regression Analysis. 216-226 - Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka:
Maximal Intersection Queries in Randomized Graph Models. 227-236 - Alexei Lisitsa, Andrei P. Nemytykh:
A Note on Specialization of Interpreters. 237-248 - Markus Lohrey, Saul Schleimer:
Efficient Computation in Groups Via Compression. 249-258 - Alexei Lysenko:
Constructing a Secret Binary Partition of a Digital Image Robust to a Loss of Synchronization. 259-268 - Meena Mahajan, Jayalal Sarma:
On the Complexity of Matrix Rank and Rigidity. 269-280 - Jorge R. Manjarrez Sanchez, José Martinez, Patrick Valduriez:
On the Usage of Clustering for Content Based Image Retrieval. 281-289 - Reza Moraveji, Hamid Sarbazi-Azad, Abbas Nayebi, Keivan Navi:
Performance Modeling of Wormhole Hypermeshes Under Hotspot Traffic. 290-302 - Valery A. Nepomniaschy, Gennady I. Alekseev, Victor S. Argirov, Dmitri M. Beloglazov, Alexandre V. Bystrov, Eugene A. Chetvertakov, Tatiana G. Churina, Sergey P. Mylnikov, Ruslan M. Novikov:
Application of Modified Coloured Petri Nets to Modeling and Verification of SDL Specified Communication Protocols. 303-314 - Sylvain Perifel:
Symmetry of Information and Nonuniform Lower Bounds. 315-327 - Vladimir V. Podolskii:
Perceptrons of Large Weight. 328-336 - Victor Poupet:
A Padding Technique on Cellular Automata to Transfer Inclusions of Complexity Classes. 337-348 - Andrey Yu. Rumyantsev:
Kolmogorov Complexity, Lovász Local Lemma and Critical Exponents. 349-355 - Alexander N. Rybalov:
Generic Complexity of Presburger Arithmetic. 356-361 - Kalle Saari:
Everywhere alpha -Repetitive Sequences and Sturmian Words. 362-372 - Robin Sharp, Michael R. Hansen:
Timed Traces and Strand Spaces. 373-386 - Vladimir V. V'yugin:
On Empirical Meaning of Randomness with Respect to a Real Parameter. 387-396 - Sergey P. Tarasov, Mikhail N. Vyalyi:
An Efficient Algorithm for Zero-Testing of a Lacunary Polynomial at the Roots of Unity. 397-406 - Alexei G. Myasnikov:
Generic Complexity of Undecidable Problems. 407-417
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-11-28 23:52 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:
