The following pages link to Alexander Russell (Q204362):
Displaying 44 items.
- (Q3172447) (← links)
- Normal subgroup reconstruction and quantum computation using group representations (Q3192035) (← links)
- (Q3396621) (← links)
- Group representations that resist random sampling (Q3452732) (← links)
- Approximate Representations, Approximate Homomorphisms, and Low-Dimensional Embeddings of Groups (Q3453573) (← links)
- The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts (Q3507527) (← links)
- (Q3522655) (← links)
- Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs (Q3541808) (← links)
- How to fool an unbounded adversary with a short key (Q3547568) (← links)
- The Symmetric Group Defies Strong Fourier Sampling (Q3549325) (← links)
- (Q3549653) (← links)
- Work-competitive scheduling for cooperative computing with dynamic groups (Q3581245) (← links)
- Soft Edge Coloring (Q3603465) (← links)
- (Q4318713) (← links)
- (Q4436048) (← links)
- (Q4440436) (← links)
- (Q4471331) (← links)
- (Q4501567) (← links)
- Extraction of optimally unbiased bits from a biased source (Q4503565) (← links)
- Markovian Hitters and the Complexity of Blind Rendezvous (Q4575623) (← links)
- Work-Competitive Scheduling on Task Dependency Graphs (Q4598901) (← links)
- (Q4668735) (← links)
- The Hidden Subgroup Problem and Quantum Computation Using Group Representations (Q4706239) (← links)
- (Q4737146) (← links)
- (Q4737240) (← links)
- The Time Complexity of A* with Approximate Heuristics on Multiple-Solution Search Spaces (Q4899134) (← links)
- An Entropic Proof of Chang's Inequality (Q4979832) (← links)
- Germ order for one-dimensional packings (Q5094170) (← links)
- The complexity of synchronous iterative Do-All with crashes (Q5138503) (← links)
- The Combinatorics of the Longest-Chain Rule: Linear Consistency for Proof-of-Stake Blockchains (Q5146841) (← links)
- McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks (Q5199224) (← links)
- Efficient probabilistically checkable proofs and applications to approximations (Q5248498) (← links)
- Quantum-Secure Symmetric-Key Cryptography Based on Hidden Shifts (Q5270358) (← links)
- Topological Neighborhoods for Spline Curves: Practice & Theory (Q5302771) (← links)
- Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups (Q5317178) (← links)
- The one-way communication complexity of subgroup membership (Q5414595) (← links)
- Optimal $\varepsilon$-Biased Sets with Just a Little Randomness (Q5499738) (← links)
- (Q5501376) (← links)
- Dealing with Undependable Workers in Decentralized Network Supercomputing (Q5507398) (← links)
- Computing and Combinatorics (Q5716961) (← links)
- Limitations of quantum coset states for graph isomorphism (Q5891930) (← links)
- Complexity bounds on general hard-core predicates. (Q5944107) (← links)
- Alternation in interaction (Q5946704) (← links)
- Ofelimos: combinatorial optimization via proof-of-useful-work. A provably secure blockchain protocol (Q6104339) (← links)
