The following pages link to Bruce M. Kapron (Q269731):
Displayed 42 items.
- MMH* with arbitrary modulus is always almost-universal (Q269733) (← links)
- Counting surface-kernel epimorphisms from a co-compact Fuchsian group to a cyclic group with motivations from string theory and QFT (Q314896) (← links)
- Restricted linear congruences (Q331108) (← links)
- Item:Q269731 (redirect page) (← links)
- A framework for non-interactive instance-dependent commitment schemes (NIC) (Q500985) (← links)
- Zero-one laws for modal logic (Q1337692) (← links)
- The modal logic of the countable random frame (Q1407589) (← links)
- Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes (Q1650802) (← links)
- Reproducible circularly secure bit encryption: applications and realizations (Q1698399) (← links)
- Limits on the power of parallel random access machines with weak forms of write conflict resolution (Q1816745) (← links)
- Feasibly continuous type-two functionals (Q1961060) (← links)
- Type-two polynomial-time and restricted lookahead (Q1989320) (← links)
- A generalization of Schönemann's theorem via a graph theoretic method (Q2324495) (← links)
- Lower bound for scalable Byzantine agreement (Q2377258) (← links)
- Logics for reasoning about cryptographic constructions (Q2490263) (← links)
- On characterizations of the basic feasible functionals, Part I (Q2740989) (← links)
- On Generic Constructions of Circularly-Secure, Leakage-Resilient Public-Key Encryption Schemes (Q2798796) (← links)
- On a restricted linear congruence (Q2833088) (← links)
- Fast asynchronous Byzantine agreement and leader election with full information (Q2930350) (← links)
- Gambling, Computational Information and Encryption Security (Q2947527) (← links)
- The Cayley Graphs Associated With Some Quasi-Perfect Lee Codes Are Ramanujan Graphs (Q2976514) (← links)
- On the Equality of Probabilistic Terms (Q3066090) (← links)
- Simultaneous Secrecy and Reliability Amplification for a General Channel Model (Q3179359) (← links)
- Reproducible Circularly-Secure Bit Encryption: Applications and Realizations (Q3457112) (← links)
- (Q3579423) (← links)
- Modal sequents and definability (Q3781736) (← links)
- (Q4035304) (← links)
- (Q4222879) (← links)
- (Q4281540) (← links)
- (Q4501141) (← links)
- On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes (Q4640336) (← links)
- A new Characterization of Type-2 Feasibility (Q4875448) (← links)
- Computational Soundness of Coinductive Symbolic Security under Active Attacks (Q4910297) (← links)
- A Note on Negative Tagging for Least Fixed-Point Formulae (Q4943549) (← links)
- (Q5094117) (← links)
- A tier-based typed programming language characterizing Feasible Functionals (Q5145661) (← links)
- Lower bound for scalable Byzantine Agreement (Q5177290) (← links)
- Toward Fine-Grained Blackbox Separations Between Semantic and Circular-Security Notions (Q5267418) (← links)
- A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC) (Q5428820) (← links)
- Resource-bounded continuity and sequentiality for type-two functionals (Q5738961) (← links)
- Dynamic graph connectivity in polylogarithmic worst case time (Q5741790) (← links)
- Complete and tractable machine-independent characterizations of second-order polytime (Q6181938) (← links)