All Publications

Articles in Conference Proceedings

• P. Gaži, A. Kiayias and A. Russell: Stake-bleeding attacks on proof-of-stake blockchains. In 2018 crypto valley conference on blockchain technology (cvcbt), 85-92, 2018. doi: 10.1109/CVCBT.2018.00015
• A. Russell, Q. Tang, M. Yung and H. Zhou: Correcting subverted random oracles. In 38th annual international cryptology conference (CRYPTO), 241-271, 2018. doi: 10.1007/978-3-319-96881-0_9
• B. David, P. Gaži, A. Kiayias and A. Russell: Ouroboros Praos: An adaptively-secure, semi-synchronous proof-of-stake blockchain. In 37th annual international conference on the theory and applications of cryptographic techniques (eurocrypt), 66-98, 2018. doi: 10.1007/978-3-319-78375-8_3
• C. Badertscher, P. Gazi, A. Kiayias, A. Russell and V. Zikas: Ouroboros genesis: Composable proof-of-stake blockchains with dynamic availability. In Proceedings of the 2018 ACM SIGSAC conference on computer and communications security, (ccs), 913-930, 2018. doi: 10.1145/3243734.3243848
• A. Russell, Q. Tang, M. Yung and H. Zhou: Generic semantic security against a kleptographic adversary. In Proceedings of the 2017 ACM SIGSAC conference on computer and communications security (ccs), 907-922, 2017. doi: 10.1145/3133956.3133993
• G. Alagic and A. Russell: Quantum-secure symmetric-key cryptography based on hidden shifts. In 36th annual international conference on the theory and applications of cryptographic techniques (eurocrypt), 65-93, 2017. doi: 10.1007/978-3-319-56617-7_3
• A. Kiayias, A. Russell, B. David and R. Oliynykov: Ouroboros: A provably secure proof-of-stake blockchain protocol. In 37th annual international cryptology conference (crypto), 357-388, 2017. doi: 10.1007/978-3-319-63688-7_12
• B. Shen, R. Sundaram, A. Russell, S. Aiyar, K. Gupta, A. Nagpal, A. Ramesh and H. Shukla: High availability for VM placement and a stochastic model for multiple knapsack. In 26th international conference on computer communication and networks (icccn), 1-9, 2017. doi: 10.1109/ICCCN.2017.8038384
• A. Russell, Q. Tang, M. Yung and H. Zhou: Cliptography: Clipping the power of kleptographic attacks. In 22nd international conference on the theory and application of cryptology and information security (asiacrypt), 34-64, 2016. doi: 10.1007/978-3-662-53890-6_2
• A. Kiayias, O. Oksuz, A. Russell, Q. Tang and B. Wang: Efficient encrypted keyword search for multi-user data sharing. In Proceedings of the 21st european symposium on research in computer security (esorics), 173-195, 2016. doi: 10.1007/978-3-319-45744-4_9
• A. Farhan, C. Yue, R. Morillo, S. Ware, J. Lu, J. Bi, J. Kamath, A. Russell, A. Bamis and B. Wang: Behavior vs. Introspection: Refining prediction of clinical depression via smartphone sensing data. In 2016 IEEE wireless health (wh), 30-37, 2016. doi: 10.1109/WH.2016.7764553
• A. Farhan, J. Lu, J. Bi, A. Russell, B. Wang and A. Bamis: Multi-view bi-clustering to identify smartphone sensing features indicative of depression. In IEEE first international conference on connected health: Applications, systems and engineering technologies (chase), 264-273, 2016. doi: 10.1109/CHASE.2016.27
• S. Chen, M. Dippel, A. Russell, A. Samanta and R. Sundaram: Markovian hitters and the complexity of blind rendezvous. In Proceedings of the twenty-seventh annual ACM-SIAM symposium on discrete algorithms (soda), 610-619, 2016. doi: 10.1137/1.9781611974331.ch45
• S. Kentros, C. Kari, A. Kiayias and A. Russell: Asynchronous adaptive task allocation. In 35th IEEE international conference on distributed computing systems (icdcs), 83-92, 2015. doi: 10.1109/ICDCS.2015.17
• S. Chen, A. Russell, R. Jin, Y. Qin, B. Wang and S. Vasudevan: Asynchronous neighbor discovery on duty-cycled mobile devices: Integer and non-integer schedules. In Proceedings of the 16th ACM international symposium on mobile ad hoc networking and computing (mobihoc), 47-56, 2015. doi: 10.1145/2746285.2746297
• S. Chen, A. Russell, R. Jin, Y. Qin, B. Wang and S. Vasudevan: Asynchronous neighbor discovery on duty-cycled mobile devices: Integer and non-integer schedules. In Proceedings of the 16th ACM international symposium on mobile ad hoc networking and computing (mobihoc), 47-56, 2015. doi: 10.1145/2746285.2746297
• S. Chen, A. Russell, A. Samanta and R. Sundaram: Deterministic blind rendezvous in cognitive radio networks. In IEEE 34th international conference on distributed computing systems (icdcs), 358-367, 2014. doi: 10.1109/ICDCS.2014.44
• S. Davtyan, K. Konwar, A. Russell and A. Shvartsman: Dealing with undependable workers in decentralized network supercomputing. In Proceedings of the 14th international conference on distributed computing and networking (icdcn), 27-41, 2013. doi: 10.1007/978-3-642-35668-1
• A. Kiayias, A. Russell and S. Narasimha: Key-efficient steganography. In Proceedings of the 14th international conference on information hiding (ih), 142-159, 2013. doi: 10.1007/978-3-642-36373-3_10
• S. Chen, C. Moore and A. Russell: Small-bias sets for nonabelian groups: Derandomizations of the Alon-Roichman theorem. In Approximation, randomization, and combinatorial optimization. Algorithms and techniques - 16th international workshop, approx 2013, and 17th international workshop, random 2013, 436-451, 2013. doi: 10.1007/978-3-642-40328-6_31
• R. Jancewicz, A. Kiayias, L. Michel, A. Russell and A. Shvartsman: Malicious takeover of voting systems: Arbitrary code execution on optical scan voting terminals. In Proceedings of the 28th annual acm symposium on applied computing (sac), 1816-1823, 2013. doi: 10.1145/2480362.2480702
• S. Davtyan, A. Kiayias, L. Michel, A. Russell and A. Shvartsman: Integrity of electronic voting systems: Fallacious use of cryptography. In Proceedings of the 27th symposium on applied computing (sac), 1486-1493, 2012. doi: 10.1145/2245276.2232013
• C. Georgiou, N. Nicolaou, A. Russell and A. Shvartsman: Towards feasible implementations of low-latency multi-writer atomic registers. In Proceedings of the tenth ieee international symposium on networking computing and applications (nca), 75-82, 2011. doi: 10.1109/NCA.2011.18
• H. Dinh, C. Moore and A. Russell: McEliece and Niederreiter cryptosystems that resist quantum fourier sampling attacks. In 31st annual cryptology conference (crypto), 761-779, 2011. doi: 10.1007/978-3-642-22792-9_43
• C. Kari, Y. Kim and A. Russell: Data migration in heterogeneous storage systems. In International conference on distributed computing systems (icdcs), 143-150, 2011. doi: 10.1109/ICDCS.2011.46
• W. Zeng, S. Vasudevan, X. Chen, B. Wang, A. Russell and W. Wei: Neighbor discovery in wireless networks with multipacket reception. In Proceedings of the 12th ACM interational symposium on mobile ad hoc networking and computing (mobihoc), 3, 2011. doi: 10.1145/2107502.2107506
• S. Bravyi, C. Moore and A. Russell: Bounds on the quantum satisfiability threshold. In Proceedings of innovations in computer science (ics), 482-489, 2010.
• S. Davtyan, S. Kentros, A. Kiayias, L. Michel, N. Nicolaou, A. Russell, A. See, N. Shashidhar and A. Shvartsman: Taking total control of voting systems: Firmware manipulations on an optical scan voting terminal. In Proceedings of the 2009 acm symposium on applied computing (sac), 2049-2053, 2009. doi: 1529282.1529736
• T. Antonyan, S. Davtyan, S. Kentros, A. Kiayias, L. Michel, N. Nicolaou, A. Russell and A. Shvartsman: Automating voting terminal event log analysis. In Proceedings of the 2009 conference on electronic voting technology/workshop on trustworthy elections, 15-15, 2009.
• H. Dinh and A. Russell: Quantum and randomized lower bounds for local search on vertex-transitive graphs. In Proceedings of the 11th international workshop, approx 2008, and 12th international workshop, random 2008 on approximation, randomization and combinatorial optimization: Algorithms and techniques, 385-401, 2008. doi: 10.1007/978-3-540-85363-3_31
• C. Kari, A. Russell and N. Shashidhar: Randomized work-competitive scheduling for cooperative computing on k-partite task graphs. In Proceedings of the 2008 seventh ieee international symposium on network computing and applications, 267-270, 2008. doi: 10.1109/NCA.2008.46
• S. Davtyan, S. Kentros, A. Kiayias, L. Michel, N. Nicolaou, A. Russell, A. See, N. Shashidhar and A. Shvartsman: Pre-election testing and post-election audit of optical scan voting terminal memory cards. In Proceedings of the conference on electronic voting technology, 7:1-7:13, 2008.
• A. Kiayias, L. Michel, A. Russell, N. Shashidhar, A. See and A. Shvartsman: An authentication and ballot layout attack against an optical scan voting terminal. In Proceedings of the usenix workshop on accurate electronic voting technology, 13-13, 2007.
• C. Kari, Y. Kim, S. Lee, A. Russell and M. Shin: Soft edge coloring. In Proceedings of the 10th international workshop on approximation and the 11th international workshop on randomization, and combinatorial optimization. Algorithms and techniques, 189-203, 2007. doi: http://dx.doi.org/10.1007/978-3-540-74208-1_14
• H. Dinh, A. Russell and Y. Su: On the value of good advice: The complexity of A* search with accurate heuristics. In Proceedings of the 22nd national conference on artificial intelligence - volume 2, 1140-1145, 2007.
• C. Moore, A. Russell and P. Sniady: On the impossibility of a quantum sieve algorithm for graph isomorphism. In Proceedings of the thirty-ninth annual acm symposium on theory of computing, 536-545, 2007. doi: http://doi.acm.org/10.1145/1250790.1250868
• G. Alagic, C. Moore and A. Russell: Quantum algorithms for Simon’s problem over general groups. In Proceedings of the eighteenth annual acm-siam symposium on discrete algorithms, 1217-1224, 2007.
• S. Hallgren, C. Moore, M. Rötteler, A. Russell and P. Sen: Limitations of quantum coset states for graph isomorphism. In Proceedings of the thirty-eighth annual acm symposium on theory of computing, 604-617, 2006. doi: http://doi.acm.org/10.1145/1132516.1132603
• C. Moore, A. Russell and L. Schulman: The symmetric group defies strong fourier sampling. In Proceedings of the 46th annual ieee symposium on foundations of computer science, 479-490, 2005. doi: http://dx.doi.org/10.1109/SFCS.2005.73
• K. Abe, J. Bisceglio, T. Peters, A. Russell and T. Sakkalis: Computational topology for reconstruction of surfaces with boundary: Integrating experiments and theory. In Proceedings of the international conference on shape modeling and applications, 290-299, 2005. doi: 10.1109/SMI.2005.8
• A. Kiayias, Y. Raekow and A. Russell: Efficient steganography with provable security guarantees. In Proceedings of the seventh international workshop on information hiding (ih), 118-130, 2005. doi: 10.1007/11558859_10
• C. Moore, D. Rockmore, A. Russell and L. Schulman: The power of basis selection in Fourier sampling: Hidden subgroup problems in affine groups. In Proceedings of the fifteenth annual acm-siam symposium on discrete algorithms, 1113-1122, 2004.
• C. Moore, D. Rockmore and A. Russell: Generic quantum Fourier transforms. In Proceedings of the fifteenth annual acm-siam symposium on discrete algorithms, 778-787, 2004.
• R. Kumar and A. Russell: A note on the set systems used for broadcast encryption. In Proceedings of the fourteenth annual acm-siam symposium on discrete algorithms, 470-471, 2003.
• C. Georgiou, A. Russell and A. Shvartsman: Distributed cooperation and adversity: Complexity trade-offs. In Proceedings of the paris c. Kanellakis memorial workshop on principles of computing & knowledge: Paris c. Kanellakis memorial workshop on the occasion of his 50th birthday, 60-71, 2003. doi: http://doi.acm.org/10.1145/778348.778358
• C. Georgiou, A. Russell and A. Shvartsman: Work-competitive scheduling for cooperative computing with dynamic groups. In Proceedings of the thirty-fifth annual acm symposium on theory of computing, 251-258, 2003. doi: http://doi.acm.org/10.1145/780542.780581
• A. Russell and H. Wang: How to fool an unbounded adversary with a short key. In Advances in cryptology - EUROCRYPT 2002, international conference on the theory and applications of cryptographic techniques, 133-148, 2002. doi: 10.1007/3-540-46035-7_9
• C. Georgiou, A. Russell and A. Shvartsman: Failure sensitive analysis for parallel algorithm with controlled memory access concurrency. In Procedings of the 6th international conference on principles of distributed systems (opodis), 125-136, 2002.
• C. Moore and A. Russell: Quantum walks on the hypercube. In Proceedings of the 6th international workshop on randomization and approximation techniques, 164-178, 2002.
• L. Engebretsen, J. Holmerin and A. Russell: Inapproximability results for equations over finite groups. In Proceedings of the 29th international colloquium on automata, languages and programming, 73-84, 2002.
• C. Georgiou, A. Russell and A. Shvartsman: Optimally work-competitive scheduling for cooperative computing with merging groups. In Proceedings of the twenty-first annual symposium on principles of distributed computing, 132-132, 2002. doi: http://doi.acm.org/10.1145/571825.571848
• C. Georgiou, A. Russell and A. Shvartsman: The complexity of synchronous iterative do-all with crashes. In Proceedings of the 15th international conference on distributed computing, 151-165, 2001.
• G. Malewicz, A. Russell and A. Shvartsman: Optimal scheduling for disconnected cooperation. In Proceedings of the twentieth annual acm symposium on principles of distributed computing, 305-307, 2001. doi: http://doi.acm.org/10.1145/383962.384048
• G. Malewicz, A. Russell and A. Shvartsman: Local scheduling for distributed cooperation. In Proceedings of the ieee international symposium on network computing and applications (nca’01), 244-, 2001.
• S. Hallgren, A. Russell and A. Ta-Shma: Normal subgroup reconstruction and quantum computation using group representations. In Proceedings of the thirty-second annual acm symposium on theory of computing (stoc), 627-635, 2000. doi: 10.1145/335305.335392
• G. Malewicz, A. Russell and A. Shvartsman: Distributed cooperation in the absence of communication. In Proceedings of the nineteenth annual acm symposium on principles of distributed computing, 339-, 2000. doi: http://doi.acm.org/10.1145/343477.362162
• C. Georgiou, A. Russell and A. Shvartsman: The complexity of distributed cooperation in the presence of failures. In Procedings of the 4th international conference on principles of distributed systems (opodis), 245-264, 2000.
• M. Goldmann and A. Russell: Spectral bounds on general hard core predicates. In Proceedings of the 17th annual symposium on theoretical aspects of computer science (stacs), 614-625, 2000.
• M. Näslund and A. Russell: Hard-core functions: Survey and new results. In Proceedings of the fifth nordic workshop on secure it systems (nordsec), 305-322, 2000.
• G. Malewicz, A. Russell and A. Shvartsman: Distributed cooperation during the absence of communication. In Proceedings of the 14th international conference on distributed computing (disc), 119-133, 2000.
• M. Goldmann and A. Russell: The complexity of solving equations over finite groups. In Proceedings of the fourteenth annual ieee conference on computational complexity, 80-86, 1999.
• A. Russell, M. Saks and D. Zuckerman: Lower bounds for leader election and collective coin-flipping in the perfect information model. In Proceedings of the thirty-first annual acm symposium on theory of computing (stoc), 339-347, 1999. doi: 10.1145/301250.301337
• M. Näslund and A. Russell: Extraction of optimally unbiased bits from a biased source. In Proceedings of the 1998 ieee information theory workshop, 90-91, 1998.
• A. Russell and D. Zuckerman: Perfect information leader election in $\log^* n + O(1)$ rounds. In Proceedings of the 39th annual symposium on foundations of computer science (focs), 576-583, 1998.
• S. Kumar, A. Russell and R. Sundaram: Faster algorithms for optical switch configuration. In Proceedings of 1997 ieee international conference on communications (icc), 1320-1324, 1997. doi: 10.1109/ICC.1997.595003
• S. Kumar, A. Russell and R. Sundaram: Approximating Latin square extensions. In Proceedings of the second annual international conference on computing and combinatorics (cocoon), 280-289, 1996. doi: 10.1007/3-540-61332-3_162
• M. Bellare, S. Goldwasser, C. Lund and A. Russell: Efficient probabilistic checkable proofs and applications to approximation. In Proceedings of the twenty-sixth annual acm symposium on theory of computing, 820-, 1994. doi: http://doi.acm.org/10.1145/195058.195467
• M. Kiwi, C. Lund, A. Russell, D. Spielman and R. Sundaram: Alternation in interaction. In Proceedings of the ninth ieee annual structure in complexity theory conference, 294-303, 6th 1994. doi: 10.1109/SCT.1994.315795
• M. Bellare, S. Goldwasser, C. Lund and A. Russell: Efficient probabilistically checkable proofs and applications to approximations. In Proceedings of the twenty-fifth annual acm symposium on theory of computing (stoc), 294-304, 1993. doi: 10.1145/167088.167174
• A. Russell: Necessary and sufficient conditions for collision-free hashing. In Advances in cryptology - CRYPTO ’92, 12th annual international cryptology conference, 433-441, 1992. doi: 10.1007/3-540-48071-4_30

Journal Articles

• J. Lu, C. Shang, C. Yue, R. Morillo, S. Ware, J. Kamath, A. Bamis, A. Russell, B. Wang and J. Bi. Joint modeling of heterogeneous sensing data for depression assessment via multi-task learning, Proc. ACM Interact. Mob. Wearable Ubiquitous Technol., 2(1):21:1-21:21, 2018. doi: 10.1145/3191753
• V. Dani, T. Hayes, C. Moore and A. Russell. Codes, lower bounds, and phase transitions in the symmetric rendezvous problem, Random Struct. Algorithms, 49(4):742-765, 2016. doi: 10.1002/rsa.20691
• C. Moore, S. Lovett and A. Russell. Group representations that resist random sampling, Random Structures and Algorithms, 47(3):605-614, 10th 2015. doi: 10.1002/rsa.20555
• C. Moore and A. Russell. Optimal $\epsilon$-biased sets with just a little randomness, SIAM Journal on Discrete Mathematics, 29(3):1303-1311, 2015. doi: 10.1137/130934490
• H. Dinh, C. Moore and A. Russell. Limitations of single coset states and quantum algorithms for code equivalence, Quantum Information and Computation, 15(3&4):260-294, 2015.
• C. El-Kari, A. Russell and N. Shashidhar. Work-competitive scheduling on task dependency graphs, Parallel Processing Letters, 25(2):1550001, 2015. doi: 10.1142/S0129626415500012
• A. Russell, S. Vasudevan, B. Wang, W. Zeng, X. Chen and W. Wei. Neighbor discovery in wireless networks with multipacket reception, IEEE Transactions on Parallel and Distributed Systems, 26(7):1984-1998, 2015. doi: 10.1109/TPDS.2014.2321157
• H. Krovi and A. Russell. Quantum Fourier transforms and the complexity of link invariants for quantum doubles of finite groups, Communications in Mathematical Physics, 334(2):743-777, 2015. doi: 10.1007/s00220-014-2285-5
• S. Davtyan, K. Konwar, A. Russell and A. Shvartsman. Dealing with undependable workers in decentralized network supercomputing, Theoretical Computer Science, 561, Part B:96-112, 2015. doi: 10.1016/j.tcs.2014.10.015
• C. Moore and A. Russell. Approximate representations, approximate homomorphisms, and low-dimensional embeddings of groups, SIAM Journal on Discrete Mathematics, 29(1):182-197, 2015. doi: 10.1137/140958578
• K. Chung, F. IV, M. Gajdosik, S. Burger, A. Russell and C. Nelson. Single cell analysis reveals the stochastic phase of reprogramming to pluripotency is an ordered probabilistic process, PLoS ONE, 9(4):e95304, 2014. doi: 10.1371/journal.pone.0095304
• A. Kiayias, Y. Raekow, A. Russell and S. Narasimha. A one-time stegosystem and its application to efficient covert communication, Journal of Cryptology, 27(1):23-44, 2014. doi: 10.1007/s00145-012-9135-4
• R. Impagliazzo, C. Moore and A. Russell. An entropic proof of Chang’s inequality, SIAM Journal on Discrete Mathematics, 28(1):173-176, 2014. doi: 10.1137/120877982
• S. Chen and A. Russell. Online metric tracking and smoothing, Algorithmica, 68(1):133-151, 2014. doi: 10.1007/s00453-012-9669-8
• C. Moore and A. Russell. Approximating the permanent via nonabelian determinants, SIAM Journal on Computing, 41(2):332-355, 2012. doi: 10.1137/100806709
• H. Dinh, H. Dinh, L. Michel and A. Russell. The time complexity of A* with approximate heuristics on multiple-solution search spaces, Journal of AI Research, 45:685-729, 2012. doi: 10.1613/jair.3779
• G. Alagic and A. Russell. Spectral concentration of positive functions on compact groups, Journal of Fourier Analysis and Applications, 17(3):355-373, 2011. doi: 10.1007/s00041-011-9174-5
• C. Moore and A. Russell. A graph integral formulation of the circuit partition polynomial, Combinatorics, Probability & Computing, 20(6):911-920, 2011. doi: 10.1017/S0963548311000393
• S. Aaronson, F. LeGall, A. Russell and S. Tani. The one-way communication complexity of subgroup membership, Chicago Journal of Theoretical Computer Science, 2011(6):1-17, 2011. doi: 10.4086/cjtcs.2011.006
• C. Moore, A. Russell and P. Śniady. On the impossibility of a quantum sieve algorithm for graph isomorphism, SIAM Journal on Computing, 39(6):2377-2396, 2010. doi: 10.1137/080724101
• A. Denney, C. Moore and A. Russell. Finding conjugate stabilizer subgroups in PSL and related groups, Quantum Information and Computation, 10(3&4):282-291, 2010.
• S. Hallgren, C. Moore, M. Rötteler, A. Russell and P. Sen. Limitations of quantum coset states for graph isomorphism, Journal of the ACM, 57(6):34:1-34:33, 2010. doi: 10.1145/1857914.1857918
• H. Dinh and A. Russell. Quantum and randomized lower bounds for local search on vertex-transitive graphs, Quantum Information and Computation, 10(7&8):636-652, 2010.
• G. Alagic, C. Moore and A. Russell. Quantum algorithms for Simon’s problem over general groups, ACM Transactions on Algorithms, 6(1, 1):19:1-19:15, 2009. doi: 10.1145/1644015.1644034
• T. Antonyan, S. Davtyan, S. Kentros, A. Kiayias, L. Michel, N. Nicolaou, A. Russell and A. Shvartsman. State-wide elections, optical scan voting systems, and the pursuit of integrity, IEEE Transactions on Information Forensics and Security, 4(4):597-610, 2009. doi: 10.1109/TIFS.2009.2033232
• K. Jordan, L. Miller, E. Moore, T. Peters and A. Russell. Modeling time and topology for animation and visualization with examples on parametric geometry, Theoretical Computer Science, 405(1-2):41-49, 2008. doi: 10.1016/j.tcs.2008.06.023
• G. Alagic and A. Russell. Uncertainty principles for compact groups, Illinois Journal of Mathematics, 52(4):1315-1324, 2008.
• C. Moore, A. Russell and L. Schulman. The symmetric group defies strong Fourier sampling, SIAM Journal on Computing, 37(6):1842-1864, 2008. doi: 10.1137/050644896
• C. Moore, D. Rockmore, A. Russell and L. Schulman. The power of strong Fourier sampling: Quantum algorithms for affine groups and hidden shifts, SIAM Journal on Computing, 37(3):938-958, 2007. doi: 10.1137/S0097539705447177
• C. Georgiou, A. Russell and A. Shvartsman. Failure-sensitive analysis of parallel algorithms with controlled memory access concurrency, Parallel Processing Letters, 17(2):153-168, 2007. doi: 10.1142/S0129626407002946
• C. Moore and A. Russell. For distinguishing conjugate hidden subgroups, the pretty good measurement is as good as it gets, Quantum Information and Computation, 7(8):752-765, 2007.
• C. Moore, D. Rockmore and A. Russell. Generic quantum Fourier transforms, ACM Transactions on Algorithms, 2(4):707-723, 2006. doi: 10.1145/1198513.1198525
• A. Russell and H. Wang. How to fool an unbounded adversary with a short key, IEEE Transactions on Information Theory, 52(3):1130-1140, 3rd 2006. doi: 10.1109/TIT.2005.864438
• R. Côté, A. Russell, E. Eyler and P. Gould. Quantum random walk with Rydberg atoms in an optical lattice, New Journal of Physics, 8(8):156, 2006. doi: 10.1088/1367-2630/8/8/156
• K. Abe, J. Bisceglio, D. Ferguson, T. Peters, A. Russell and T. Sakkalis. Computational topology for isotopic surface reconstruction, Theoretical Computer Science, 365(3):184-198, 2006. doi: 10.1016/j.tcs.2006.07.062
• G. Malewicz, A. Russell and A. Shvartsman. Distributed scheduling for disconnected cooperation, Distributed Computing, 18(6, 6):409-420, 2006. doi: 10.1007/s00446-005-0149-0
• A. Fernández, C. Georgiou, A. Russell and A. Shvartsman. The Do-All problem with Byzantine processor failures, Theoretical Computer Science, 333(3):433-454, 2005. doi: 10.1016/j.tcs.2004.06.034
• C. Georgiou, A. Russell and A. Shvartsman. Work-competitive scheduling for cooperative computing with dynamic groups, SIAM Journal on Computing, 34(4):848-862, 2005. doi: 10.1137/S0097539704440442
• G. Alagic and A. Russell. Decoherence in quantum walks on the hypercube, Phys. Rev. A, 72(6):062304, 12th 2005. doi: 10.1103/PhysRevA.72.062304
• L. Engebretsen, J. Holmerin and A. Russell. Inapproximability results for equations over finite groups, Theoretical Computer Science, 312(1):17-45, 2004. doi: 10.1016/S0304-3975(03)00401-8
• M. Kiwi and A. Russell. The Chilean highway problem, Theoretical Computer Science, 326(1-3):329-342, 2004. doi: 10.1016/j.tcs.2004.07.030
• C. Georgiou, A. Russell and A. Shvartsman. Analysis of instant and total memory access concurrency in robust parallel algorithms, Studia Informatica Universalis, 3(2):125-150, 2004.
• Z. Landau and A. Russell. Random Cayley graphs are expanders: A simple proof of the Alon-Roichman theorem, Electronic Journal of Combinatorics, 11(1):R62, 2004.
• A. Russell and I. Shparlinski. Classical and quantum function reconstruction via character evaluation, Journal of Complexity, 20(2-3):404-422, 2004. doi: 10.1016/j.jco.2003.08.019
• C. Georgiou, A. Russell and A. Shvartsman. The complexity of synchronous iterative Do-All with crashes, Distributed Computing, 17(1):47-63, 2004. doi: 10.1007/s00446-003-0099-3
• S. Hallgren, A. Russell and A. Ta-Shma. The hidden subgroup problem and quantum computation using group representations, SIAM Journal on Computing, 32(4):916-934, 2003. doi: 10.1137/S009753970139450X
• N. Amenta, T. Peters and A. Russell. Computational topology: Ambient isotopic approximation of 2-manifolds, Theoretical Computer Science, 305(1-3):3-15, 2003. doi: 10.1016/S0304-3975(02)00691-6
• M. Goldmann and A. Russell. The complexity of solving equations over finite groups, Information and Computation, 178(1):253-262, 2002. doi: 10.1016/S0890-5401(02)93173-1
• A. Russell, M. Saks and D. Zuckerman. Lower bounds for leader election and collective coin-flipping in the perfect information model, SIAM Journal on Computing, 31(6):1645-1662, 2002. doi: 10.1137/S0097539700376007
• M. Goldmann, M. Näslund and A. Russell. Complexity bounds on general hard-core predicates, Journal of Cryptology, 14(3):177-195, 2001. doi: 10.1007/s00145-001-0007-6
• A. Russell and D. Zuckerman. Perfect information leader election in $\log^* n + O(1)$ rounds, Journal of Computer and System Sciences, 63(4):612-626, 2001. doi: 10.1006/jcss.2001.1776
• M. Näslund and A. Russell. Extraction of optimally unbiased bits from a biased source, IEEE Transactions on Information Theory, 46(3):1093-1103, 2000. doi: 10.1109/18.841191
• M. Kiwi, C. Lund, A. Russell, D. Spielman and R. Sundaram. Alternation in interaction, Computational Complexity, 9(3-4):202-246, 2000. doi: 10.1007/PL00001607
• A. Russell. An easy reduction of an isoperimetric inequality on the sphere to extremal set theory, The American Mathematical Monthly, 107(1):57-59, 2000. doi: 10.2307/2589379
• M. Goldmann, A. Russell and D. Thérien. An ergodic theorem for read-once non-uniform deterministic finite automata, Information Processing Letters, 73(1-2):23-28, 2000. doi: 10.1016/S0020-0190(99)00162-3
• S. Kumar, A. Russell and R. Sundaram. Approximating Latin square extensions, Algorithmica, 24(2):128-138, 1999. doi: 10.1007/PL00009274
• A. Russell and R. Sundaram. Symmetric alternation captures BPP, Computational Complexity, 7(2):152-162, 1998. doi: 10.1007/s000370050007
• M. Klugerman, A. Russell and R. Sundaram. On embedding complete graphs into hypercubes, Discrete Mathematics, 186(1-3):289-293, 5th 1998. doi: 10.1016/S0012-365X(97)00239-2
• A. Russell and R. Sundaram. A note on the asymptotics and computational complexity of graph distinguishability, Electronic Journal of Combinatorics, 5(1):R23, 1998.
• S. Kumar, R. Panigrahy, A. Russell and R. Sundaram. A note on optical routing on trees, Information Processing Letters, 62(6):295-300, 1997. doi: 10.1016/S0020-0190(97)00077-X
• A. Russell and R. Sundaram. The relativized relationship between probabilistically checkable debate systems, IP and PSPACE, Information Processing Letters, 53(2):61-68, 1995. doi: 10.1016/0020-0190(94)00185-2
• A. Russell. Necessary and sufficient conditions for collision-free hashing, Journal of Cryptology, 8(2):87-99, 1995. doi: 10.1007/BF00190757
• A. Segre, C. Elkan and A. Russell. A critical look at experimental evaluations of EBL, Machine Learning, 6(2):183-195, 1991. doi: 10.1023/A:1022658420943

Book Chapters

• L. Miller, E. Moore, T. Peters and A. Russell. Reliable implementation of real number algorithms: Theory and practice. In P. Hertling, C. Hoffmann, W. Luther and N. Revol, Editors, , 149-161, 2008. doi: http://dx.doi.org/10.1007/978-3-540-85521-7_9