The SCEAS System
Navigation Menu

Conferences in DBLP

International Colloquium on Automata, Languages and Programming (ICALP) (icalp)
2008 (conf/icalp/2008-2)

  1. Composable Formal Security Analysis: Juggling Soundness, Simplicity and Efficiency. [Citation Graph (, )][DBLP]

  2. Newton's Method for omega-Continuous Semirings. [Citation Graph (, )][DBLP]

  3. The Tractability Frontier for NFA Minimization. [Citation Graph (, )][DBLP]

  4. Finite Automata, Digraph Connectivity, and Regular Expression Size. [Citation Graph (, )][DBLP]

  5. Leftist Grammars Are Non-primitive Recursive. [Citation Graph (, )][DBLP]

  6. On the Computational Completeness of Equations over Sets of Natural Numbers. [Citation Graph (, )][DBLP]

  7. Placement Inference for a Client-Server Calculus. [Citation Graph (, )][DBLP]

  8. Extended pi-Calculi. [Citation Graph (, )][DBLP]

  9. Completeness and Logical Full Abstraction in Modal Logics for Typed Mobile Processes. [Citation Graph (, )][DBLP]

  10. On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases. [Citation Graph (, )][DBLP]

  11. On Expressiveness and Complexity in Real-Time Model Checking. [Citation Graph (, )][DBLP]

  12. STORMED Hybrid Systems. [Citation Graph (, )][DBLP]

  13. Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives. [Citation Graph (, )][DBLP]

  14. On Datalog vs. LFP. [Citation Graph (, )][DBLP]

  15. Directed st-Connectivity Is Not Expressible in Symmetric Datalog. [Citation Graph (, )][DBLP]

  16. Non-dichotomies in Constraint Satisfaction Complexity. [Citation Graph (, )][DBLP]

  17. Quantified Constraint Satisfaction and the Polynomially Generated Powers Property. [Citation Graph (, )][DBLP]

  18. When Does Partial Commutative Closure Preserve Regularity? [Citation Graph (, )][DBLP]

  19. Weighted Logics for Nested Words and Algebraic Formal Power Series. [Citation Graph (, )][DBLP]

  20. Tree Languages Defined in First-Order Logic with One Quantifier Alternation. [Citation Graph (, )][DBLP]

  21. Duality and Equational Theory of Regular Languages. [Citation Graph (, )][DBLP]

  22. Reversible Flowchart Languages and the Structured Reversible Program Theorem. [Citation Graph (, )][DBLP]

  23. Attribute Grammars and Categorical Semantics. [Citation Graph (, )][DBLP]

  24. A Domain Theoretic Model of Qubit Channels. [Citation Graph (, )][DBLP]

  25. Interacting Quantum Observables. [Citation Graph (, )][DBLP]

  26. Perpetuality for Full and Safe Composition (in a Constructive Setting). [Citation Graph (, )][DBLP]

  27. A System F with Call-by-Name Exceptions. [Citation Graph (, )][DBLP]

  28. Linear Logical Algorithms. [Citation Graph (, )][DBLP]

  29. A Simple Model of Separation Logic for Higher-Order Store. [Citation Graph (, )][DBLP]

  30. Open Implication. [Citation Graph (, )][DBLP]

  31. ATL* Satisfiability Is 2EXPTIME-Complete. [Citation Graph (, )][DBLP]

  32. Visibly Pushdown Transducers. [Citation Graph (, )][DBLP]

  33. The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata. [Citation Graph (, )][DBLP]

  34. Analyzing Context-Free Grammars Using an Incremental SAT Solver. [Citation Graph (, )][DBLP]

  35. Weak Pseudorandom Functions in Minicrypt. [Citation Graph (, )][DBLP]

  36. On Black-Box Ring Extraction and Integer Factorization. [Citation Graph (, )][DBLP]

  37. Extractable Perfectly One-Way Functions. [Citation Graph (, )][DBLP]

  38. Error-Tolerant Combiners for Oblivious Primitives. [Citation Graph (, )][DBLP]

  39. Asynchronous Multi-Party Computation with Quadratic Communication. [Citation Graph (, )][DBLP]

  40. Improved Garbled Circuit: Free XOR Gates and Applications. [Citation Graph (, )][DBLP]

  41. Improving the Round Complexity of VSS in Point-to-Point Networks. [Citation Graph (, )][DBLP]

  42. How to Protect Yourself without Perfect Shredding. [Citation Graph (, )][DBLP]

  43. Universally Composable Undeniable Signature. [Citation Graph (, )][DBLP]

  44. Interactive PCP. [Citation Graph (, )][DBLP]

  45. Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model. [Citation Graph (, )][DBLP]

  46. Delegating Capabilities in Predicate Encryption Systems. [Citation Graph (, )][DBLP]

  47. Bounded Ciphertext Policy Attribute Based Encryption. [Citation Graph (, )][DBLP]

  48. Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks. [Citation Graph (, )][DBLP]

  49. Composable Security in the Bounded-Quantum-Storage Model. [Citation Graph (, )][DBLP]

  50. On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak. [Citation Graph (, )][DBLP]

  51. History-Independent Cuckoo Hashing. [Citation Graph (, )][DBLP]

  52. Building a Collision-Resistant Compression Function from Non-compressing Primitives. [Citation Graph (, )][DBLP]

  53. Robust Multi-property Combiners for Hash Functions Revisited. [Citation Graph (, )][DBLP]

  54. Homomorphic Encryption with CCA Security. [Citation Graph (, )][DBLP]

  55. How to Encrypt with the LPN Problem. [Citation Graph (, )][DBLP]

  56. Could SFLASH be Repaired?. [Citation Graph (, )][DBLP]

  57. Password Mistyping in Two-Factor-Authenticated Key Exchange. [Citation Graph (, )][DBLP]

  58. Affiliation-Hiding Envelope and Authentication Schemes with Efficient Support for Multiple Credentials. [Citation Graph (, )][DBLP]

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002