- 2007
- Scott Aaronson:
The Limits of Quantum Computers. CSR 2007: 4 - Rajeev Alur:
Marrying Words and Trees. CSR 2007: 5 - Bogdan Aman
, Gabriel Ciobanu:
Timers and Proximities for Mobile Ambients. CSR 2007: 33-43 - Ehsan Amiri, Evgeny S. Skvortsov:
Pushing Random Walk Beyond Golden Ratio. CSR 2007: 44-55 - Holger Bock Axelsen, Robert Glück, Tetsuo Yokoyama:
Reversible Machine Code and Its Abstract Processor Architecture. CSR 2007: 56-69 - Maxim A. Babenko:
A Fast Algorithm for Path 2-Packing Problem. CSR 2007: 70-81 - Danièle Beauquier, Marie Duflot, Yury Lifshits:
Decidability of Parameterized Probabilistic Information Flow. CSR 2007: 82-91 - Harry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolai K. Vereshchagin:
Inverting Onto Functions and Polynomial Hierarchy. CSR 2007: 92-103 - Dominique Cansell, Dominique Méry:
Proved-Patterns-Based Development for Structured Programs. CSR 2007: 104-114 - Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan:
Planarity, Determinants, Permanents, and (Unique) Matchings. CSR 2007: 115-126 - Christian Glaßer, Katrin Herr, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr:
Equivalence Problems for Circuits over Sets of Natural Numbers. CSR 2007: 127-138 - Victor S. Grishchenko:
Bouillon: A Wiki-Wiki Social Web. CSR 2007: 139-145 - Yuri Gurevich:
Proving Church's Thesis. CSR 2007: 1-3 - Ziyad Hanna:
Abstract Modeling and Formal Verification of Microprocessors. CSR 2007: 23 - Bernhard Heinemann:
A PDL-Like Logic of Knowledge Acquisition. CSR 2007: 146-157 - Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka:
Maximal Intersection Queries in Randomized Graph Models. CSR 2007: 227-236 - Navid Imani, Hamid Sarbazi-Azad, Selim G. Akl:
Resource Placement in Networks Using Chromatic Sets of Power Graphs. CSR 2007: 158-167 - Artur Jez, Alexander Okhotin:
Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth. CSR 2007: 168-181 - Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen:
Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems. CSR 2007: 182-193 - Alexander S. Kulikov, Konstantin Kutzkov:
New Bounds for MAX-SAT by Clause Learning. CSR 2007: 194-204 - Mark Sh. Levin:
Towards Hierarchical Clustering (Extended Abstract). CSR 2007: 205-215 - Yury Lifshits, Dirk Nowotka:
Estimation of the Click Volume by Large Scale Regression Analysis. CSR 2007: 216-226 - Alexei Lisitsa, Andrei P. Nemytykh:
A Note on Specialization of Interpreters. CSR 2007: 237-248 - Markus Lohrey, Saul Schleimer:
Efficient Computation in Groups Via Compression. CSR 2007: 249-258 - Alexei Lysenko:
Constructing a Secret Binary Partition of a Digital Image Robust to a Loss of Synchronization. CSR 2007: 259-268 - Meena Mahajan, Jayalal Sarma:
On the Complexity of Matrix Rank and Rigidity. CSR 2007: 269-280 - Reza Moraveji, Hamid Sarbazi-Azad, Abbas Nayebi, Keivan Navi:
Performance Modeling of Wormhole Hypermeshes Under Hotspot Traffic. CSR 2007: 290-302 - Alexei G. Myasnikov:
Generic Complexity of Undecidable Problems. CSR 2007: 407-417 - 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. CSR 2007: 303-314 - Sylvain Perifel:
Symmetry of Information and Nonuniform Lower Bounds. CSR 2007: 315-327
