The following pages link to Alexander Russell (Q204362):
Displaying 50 items.
- A note on optical routing on trees (Q287098) (← links)
- Dealing with undependable workers in decentralized network supercomputing (Q477093) (← links)
- The relativized relationship between probabilistically checkable debate systems, IP and PSPACE (Q673812) (← links)
- The chilean highway problem (Q703556) (← links)
- Spectral concentration of positive functions on compact groups (Q719698) (← links)
- (Q854175) (redirect page) (← links)
- Computational topology for isotopic surface reconstruction (Q854177) (← links)
- Modeling time and topology for animation and visualization with examples on parametric geometry (Q949613) (← links)
- Symmetric alternation captures BPP (Q1272661) (← links)
- A note on the asymptotic and computational complexity of graph distinguishability (Q1385847) (← links)
- Computational topology: Ambient isotopic approximation of 2-manifolds. (Q1427770) (← links)
- On embedding complete graphs into hypercubes (Q1584282) (← links)
- Perfect information leader election in \(\log^*n+O(1)\) rounds (Q1604211) (← links)
- Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain (Q1648822) (← links)
- Ouroboros: a provably secure proof-of-stake blockchain protocol (Q1675731) (← links)
- Correcting subverted random oracles (Q1784091) (← links)
- Classical and quantum function reconstruction via character evaluation (Q1827578) (← links)
- The complexity of solving equations over finite groups (Q1854566) (← links)
- Random Cayley graphs are expanders: a simple proof of the Alon-Roichman theorem (Q1883682) (← links)
- Inapproximability results for equations over finite groups (Q1884871) (← links)
- Necessary and sufficient conditions for collision-free hashing (Q1894973) (← links)
- Efficient simulation of random states and random unitaries (Q2055680) (← links)
- Quantum-access-secure message authentication via blind-unforgeability (Q2055681) (← links)
- Ledger combiners for fast settlement (Q2055725) (← links)
- Dynamic ad hoc clock synchronization (Q2056800) (← links)
- Fast isomorphic state channels (Q2147250) (← links)
- Quantum Fourier transforms and the complexity of link invariants for quantum doubles of finite groups (Q2258015) (← links)
- Let a non-barking watchdog bite: cliptographic signatures with an offline watchdog (Q2289210) (← links)
- Distributed scheduling for disconnected cooperation (Q2375304) (← links)
- Online metric tracking and smoothing (Q2441592) (← links)
- A one-time stegosystem and applications to efficient covert communication (Q2442646) (← links)
- Uncertainty principles for compact groups (Q2654681) (← links)
- Achieving Optimal Fairness from Biased Coinflips (Q2708630) (← links)
- An Easy Reduction of an Isoperimetric Inequality on the Sphere to Extremal Set Theory (Q2757425) (← links)
- (Q2766867) (← links)
- Efficient probabilistic checkable proofs and applications to approximation (Q2817678) (← links)
- Lower bounds for leader election and collective coin-flipping in the perfect information model (Q2819564) (← links)
- Small-Bias Sets for Nonabelian Groups (Q2851876) (← links)
- Estimating Parameters of Generalized Integrate-and-Fire Neurons from the Maximum Likelihood of Spike Trains (Q2887011) (← links)
- Approximating the Permanent via Nonabelian Determinants (Q2903520) (← links)
- Quantum algorithms for Simon's problem over nonabelian groups (Q2930295) (← links)
- (Q2934717) (← links)
- Generic quantum Fourier transforms (Q2944537) (← links)
- Codes, lower bounds, and phase transitions in the symmetric rendezvous problem (Q2953697) (← links)
- Cliptography: Clipping the Power of Kleptographic Attacks (Q2953772) (← links)
- On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism (Q3068637) (← links)
- (Q3085181) (← links)
- A Graph Integral Formulation of the Circuit Partition Polynomial (Q3103635) (← links)
- Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model (Q3149888) (← links)
- (Q3152802) (← links)
