The SCEAS System
Navigation Menu

Conferences in DBLP

(csr)
2007 (conf/csr/2007)

  1. Yuri Gurevich
    Proving Church's Thesis. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:1-3 [Conf]
  2. Scott Aaronson
    The Limits of Quantum Computers. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:4- [Conf]
  3. Rajeev Alur
    Marrying Words and Trees. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:5- [Conf]
  4. Geoff Sutcliffe
    TPTP, TSTP, CASC, etc. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:6-22 [Conf]
  5. Ziyad Hanna
    Abstract Modeling and Formal Verification of Microprocessors. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:23- [Conf]
  6. Géraud Sénizergues
    Sequences of Level 1, 2, 3, ..., k , ... [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:24-32 [Conf]
  7. Bogdan Aman, Gabriel Ciobanu
    Timers and Proximities for Mobile Ambients. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:33-43 [Conf]
  8. Ehsan Amiri, Evgeny S. Skvortsov
    Pushing Random Walk Beyond Golden Ratio. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:44-55 [Conf]
  9. Holger Bock Axelsen, Robert Glück, Tetsuo Yokoyama
    Reversible Machine Code and Its Abstract Processor Architecture. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:56-69 [Conf]
  10. Maxim A. Babenko
    A Fast Algorithm for Path 2-Packing Problem. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:70-81 [Conf]
  11. Danièle Beauquier, Marie Duflot, Yury Lifshits
    Decidability of Parameterized Probabilistic Information Flow. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:82-91 [Conf]
  12. Harry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolai K. Vereshchagin
    Inverting Onto Functions and Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:92-103 [Conf]
  13. Dominique Cansell, Dominique Méry
    Proved-Patterns-Based Development for Structured Programs. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:104-114 [Conf]
  14. Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan
    Planarity, Determinants, Permanents, and (Unique) Matchings. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:115-126 [Conf]
  15. Christian Glaßer, Katrin Herr, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr
    Equivalence Problems for Circuits over Sets of Natural Numbers. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:127-138 [Conf]
  16. Victor S. Grishchenko
    Bouillon: A Wiki-Wiki Social Web. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:139-145 [Conf]
  17. Bernhard Heinemann
    A PDL-Like Logic of Knowledge Acquisition. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:146-157 [Conf]
  18. Navid Imani, Hamid Sarbazi-Azad, Selim G. Akl
    Resource Placement in Networks Using Chromatic Sets of Power Graphs. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:158-167 [Conf]
  19. Artur Jez, Alexander Okhotin
    Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:168-181 [Conf]
  20. Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
    Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:182-193 [Conf]
  21. Alexander S. Kulikov, Konstantin Kutzkov
    New Bounds for MAX-SAT by Clause Learning. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:194-204 [Conf]
  22. Mark Sh. Levin
    Towards Hierarchical Clustering (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:205-215 [Conf]
  23. Yury Lifshits, Dirk Nowotka
    Estimation of the Click Volume by Large Scale Regression Analysis. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:216-226 [Conf]
  24. Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka
    Maximal Intersection Queries in Randomized Graph Models. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:227-236 [Conf]
  25. Alexei Lisitsa, Andrei P. Nemytykh
    A Note on Specialization of Interpreters. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:237-248 [Conf]
  26. Markus Lohrey, Saul Schleimer
    Efficient Computation in Groups Via Compression. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:249-258 [Conf]
  27. Alexei Lysenko
    Constructing a Secret Binary Partition of a Digital Image Robust to a Loss of Synchronization. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:259-268 [Conf]
  28. Meena Mahajan, Jayalal M. N. Sarma
    On the Complexity of Matrix Rank and Rigidity. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:269-280 [Conf]
  29. Jorge R. Manjarrez Sanchez, José Martinez, Patrick Valduriez
    On the Usage of Clustering for Content Based Image Retrieval. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:281-289 [Conf]
  30. Reza Moraveji, Hamid Sarbazi-Azad, Abbas Nayebi, Keyvan Navi
    Performance Modeling of Wormhole Hypermeshes Under Hotspot Traffic. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:290-302 [Conf]
  31. 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. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:303-314 [Conf]
  32. Sylvain Perifel
    Symmetry of Information and Nonuniform Lower Bounds. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:315-327 [Conf]
  33. Vladimir V. Podolskii
    Perceptrons of Large Weight. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:328-336 [Conf]
  34. Victor Poupet
    A Padding Technique on Cellular Automata to Transfer Inclusions of Complexity Classes. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:337-348 [Conf]
  35. Andrey Yu. Rumyantsev
    Kolmogorov Complexity, Lovász Local Lemma and Critical Exponents. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:349-355 [Conf]
  36. Alexander Rybalov
    Generic Complexity of Presburger Arithmetic. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:356-361 [Conf]
  37. Kalle Saari
    Everywhere alpha -Repetitive Sequences and Sturmian Words. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:362-372 [Conf]
  38. Robin Sharp, Michael R. Hansen
    Timed Traces and Strand Spaces. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:373-386 [Conf]
  39. Vladimir V'yugin
    On Empirical Meaning of Randomness with Respect to a Real Parameter. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:387-396 [Conf]
  40. Sergey P. Tarasov, Mikhail N. Vyalyi
    An Efficient Algorithm for Zero-Testing of a Lacunary Polynomial at the Roots of Unity. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:397-406 [Conf]
  41. Alexei G. Myasnikov
    Generic Complexity of Undecidable Problems. [Citation Graph (0, 0)][DBLP]
    CSR, 2007, pp:407-417 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002