| Complete and tractable machine-independent characterizations of second-order polytime | 0 | 0.34 | 2022 |
| Type-two Iteration with Bounded Query Revision. | 0 | 0.34 | 2019 |
| Unweighted linear congruences with distinct coordinates and the Varshamov–Tenengolts codes | 0 | 0.34 | 2018 |
| A Survey of Classes of Primitive Recursive Functions. | 0 | 0.34 | 2017 |
| Reproducible Circularly Secure Bit Encryption: Applications and Realizations. | 0 | 0.34 | 2017 |
| A generalization of Schönemann's theorem via a graph theoretic method. | 0 | 0.34 | 2017 |
| Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions. | 0 | 0.34 | 2017 |
| The Cayley Graphs Associated With Some Quasi-Perfect Lee Codes Are Ramanujan Graphs. | 1 | 0.36 | 2016 |
| MMH⁎ with arbitrary modulus is always almost-universal. | 3 | 0.48 | 2016 |
| Stability of certainty and opinion in influence networks. | 0 | 0.34 | 2016 |
| On Generic Constructions of Circularly-Secure, Leakage-Resilient Public-Key Encryption Schemes. | 43 | 3.50 | 2016 |
| On a variant of multilinear modular hashing with applications to authentication and secrecy codes | 0 | 0.34 | 2016 |
| Semantically Non-preserving Transformations for Antivirus Evaluation. | 0 | 0.34 | 2016 |
| Simultaneous Secrecy and Reliability Amplification for a General Channel Model. | 0 | 0.34 | 2016 |
| On an almost-universal hash function family with applications to authentication and secrecy codes. | 1 | 0.39 | 2015 |
| Restricted linear congruences and an authenticated encryption scheme. | 1 | 0.35 | 2015 |
| Restricted linear congruences | 1 | 0.35 | 2015 |
| Reproducible Circularly-Secure Bit Encryption: Applications and Realizations | 2 | 0.36 | 2015 |
| Dynamic graph connectivity with improved worst case update time and sublinear space | 10 | 0.52 | 2015 |
| On almost-universal multilinear modular hashing with composite moduli | 0 | 0.34 | 2015 |
| Gambling, Computational Information And Encryption Security | 0 | 0.34 | 2015 |
| Why Waldo befriended the dummy? k-Anonymization of social networks with pseudo-nodes. | 13 | 0.60 | 2013 |
| Dynamic graph connectivity in polylogarithmic worst case time | 49 | 1.63 | 2013 |
| Complexity of social network anonymization. | 22 | 0.81 | 2013 |
| Computational soundness of coinductive symbolic security under active attacks | 1 | 0.37 | 2013 |
| k-Anonymization of Social Networks by Vertex Addition. | 16 | 0.67 | 2011 |
| Co-induction and Computational Semantics for Public-key Encryption with Key Cycles. | 0 | 0.34 | 2011 |
| Computational Indistinguishability Logic | 18 | 0.71 | 2010 |
| On the Equality of Probabilistic Terms | 7 | 0.44 | 2010 |
| Fast asynchronous byzantine agreement and leader election with full information | 29 | 0.96 | 2010 |
| Lower bound for scalable Byzantine Agreement | 9 | 0.66 | 2008 |
| A characterization of non-interactive instance-dependent commitment-schemes (NIC) | 8 | 0.49 | 2007 |
| Logics for Reasoning about Cryptographic Constructions | 40 | 1.15 | 2006 |
| Erratum to “Zero-one laws for modal logic” [Ann. Pure Appl. Logic 69 (1994) 157–193] | 0 | 0.34 | 2003 |
| The modal logic of the countable random frame | 2 | 0.38 | 2003 |
| On characterizations of the basic feasible functionals, Part I | 17 | 0.84 | 2001 |
| Resource-bounded continuity and sequentiality for type-two functionals | 2 | 0.39 | 2000 |
| A note on negative tagging for least fixed-point formulae | 0 | 0.34 | 1999 |
| Feasibly continuous type-two functionals | 2 | 0.50 | 1999 |
| A modal mu-calculus and a proof system for value passing processes | 2 | 0.42 | 1996 |
| Parallel computable higher type functionals (Extended Abstract) | 1 | 0.38 | 1993 |
| A new characterization of Mehlhorn's polynomial time functionals (extended abstract) | 1 | 0.36 | 1991 |
| Characterizations of the Basic Feasible Functionals of Finite Type (Extended Abstract) | 0 | 0.34 | 1989 |
| Modal Sequents And Definability | 7 | 2.20 | 1987 |
