 | 2009 |
|---|
| 96 |       | Seda Davtyan,
Sotiris Kentros,
Aggelos Kiayias,
Laurent D. Michel,
Nicolas C. Nicolaou,
Alexander Russell,
Andrew See,
Narasimha Shashidhar,
Alexander A. Shvartsman:
Taking total control of voting systems: firmware manipulations on an optical scan voting terminal.
SAC 2009: 2049-2053 |
| 95 | | Scott Aaronson,
François Le Gall,
Alexander Russell,
Seiichiro Tani:
The One-Way Communication Complexity of Group Membership
CoRR abs/0902.3175: (2009) |
| 94 | | Cristopher Moore,
Alexander Russell:
Approximating the Permanent via Nonabelian Determinants
CoRR abs/0906.1702: (2009) |
| 93 | | Sergey Bravyi,
Cristopher Moore,
Alexander Russell:
Bounds on the quantum satisfibility threshold
CoRR abs/0907.1297: (2009) |
| 92 | | Aggelos Kiayias,
Yona Raekow,
Alexander Russell,
Narasimha Shashidhar:
Efficient Steganography with Provable Security Guarantees
CoRR abs/0909.3658: (2009) |
| 91 | | Aggelos Kiayias,
Alexander Russell,
Narasimha Shashidhar:
Randomness-optimal Steganography
CoRR abs/0909.4575: (2009) |
| 2008 |
|---|
| 90 | | Hang Dinh,
Alexander Russell:
Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs.
APPROX-RANDOM 2008: 385-401 |
| 89 | | Seda Davtyan,
Sotiris Kentros,
Aggelos Kiayias,
Laurent Michel,
Nicolas C. Nicolaou,
Alexander Russell,
Andrew See,
Narasimha Shashidhar,
Alexander A. Shvartsman:
Pre-Election Testing and Post-Election Audit of Optical Scan Voting Terminal Memory Cards.
EVT 2008 |
| 88 | | Garrick Orchard,
Alexander Russell,
Kevin Mazurek,
Francesco Tenore,
Ralph Etienne-Cummings:
Configuring silicon neural networks using genetic algorithms.
ISCAS 2008: 1048-1051 |
| 87 | | Fopefolu O. Folowosele,
Francesco Tenore,
Alexander Russell,
Garrick Orchard,
Mark P. Vismer,
Jonathan Tapson,
Ralph Etienne-Cummings:
Implementing a neuromorphic cross-correlation engine with silicon neurons.
ISCAS 2008: 2162-2165 |
| 86 | | Chadi Kari,
Alexander Russell,
Narasimha Shashidhar:
Randomized Work-Competitive Scheduling for Cooperative Computing on k-partite Task Graphs.
NCA 2008: 267-270 |
| 85 | | Lance Edward Miller,
Edward L. F. Moore,
Thomas J. Peters,
Alexander Russell:
Topological Neighborhoods for Spline Curves: Practice & Theory.
Reliable Implementation of Real Number Algorithms 2008: 149-161 |
| 84 | | Chadi Kari,
Alexander Russell,
Narasimha Shashidhar:
Randomized Work-Competitive Scheduling for Cooperative Computing on $k$-partite Task Graphs
CoRR abs/0805.1257: (2008) |
| 83 | | Hang Dinh,
Alexander Russell:
Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs
CoRR abs/0806.3437: (2008) |
| 82 | | Cristopher Moore,
Alexander Russell:
A simple constant-probability RP reduction from NP to Parity P
CoRR abs/0810.1018: (2008) |
| 81 | | Cristopher Moore,
Alexander Russell:
A simple constant-probability RP reduction from NP to Parity P.
Electronic Colloquium on Computational Complexity (ECCC) 15(093): (2008) |
| 80 | | Cristopher Moore,
Alexander Russell,
Leonard J. Schulman:
The Symmetric Group Defies Strong Fourier Sampling.
SIAM J. Comput. 37(6): 1842-1864 (2008) |
| 79 | | K. E. Jordan,
Lance Edward Miller,
Edward L. F. Moore,
Thomas J. Peters,
Alexander Russell:
Modeling time and topology for animation and visualization with examples on parametric geometry.
Theor. Comput. Sci. 405(1-2): 41-49 (2008) |
| 2007 |
|---|
| 78 |  | Hang T. Dinh,
Alexander Russell,
Yuan Su:
On the Value of Good Advice: The Complexity of A* Search with Accurate Heuristics.
AAAI 2007: 1140-1145 |
| 77 | | Aggelos Kiayias,
Laurent Michel,
Alexander Russell,
Narasimha Shashidhar,
Andrew See,
Alexander A. Shvartsman,
Seda Davtyan:
Tampering with Special Purpose Trusted Computing Devices: A Case Study in Optical Scan E-Voting.
ACSAC 2007: 30-39 |
| 76 | | Chadi Kari,
Yoo Ah Kim,
Seungjoon Lee,
Alexander Russell,
Minho Shin:
Soft Edge Coloring.
APPROX-RANDOM 2007: 189-203 |
| 75 | | Alexander Russell,
Garrick Orchard,
Ralph Etienne-Cummings:
Configuring of Spiking Central Pattern Generator Networks for Bipedal Walking Using Genetic Algorthms.
ISCAS 2007: 1525-1528 |
| 74 | | Gorjan Alagic,
Cristopher Moore,
Alexander Russell:
Quantum algorithms for Simon's problem over general groups.
SODA 2007: 1217-1224 |
| 73 | | Cristopher Moore,
Alexander Russell,
Piotr Sniady:
On the impossibility of a quantum sieve algorithm for graph isomorphism.
STOC 2007: 536-545 |
| 72 | | Chryssis Georgiou,
Alexander Russell,
Alexander A. Shvartsman:
Failure-Sensitive Analysis of Parallel Algorithms with Controlled Memory Access Concurrency.
Parallel Processing Letters 17(2): 153-168 (2007) |
| 71 | | Cristopher Moore,
Daniel N. Rockmore,
Alexander Russell,
Leonard J. Schulman:
The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts.
SIAM J. Comput. 37(3): 938-958 (2007) |
| 2006 |
|---|
| 70 | | Mohammad Taghi Hajiaghayi,
Kamal Jain,
Lap Chi Lau,
Ion I. Mandoiu,
Alexander Russell,
Vijay V. Vazirani:
Minimum Multicolored Subgraph Problem in Multiplex PCR Primer Set Selection and Population Haplotyping.
International Conference on Computational Science (2) 2006: 758-766 |
| 69 | | Sean Hallgren,
Cristopher Moore,
Martin Rötteler,
Alexander Russell,
Pranab Sen:
Limitations of quantum coset states for graph isomorphism.
STOC 2006: 604-617 |
| 68 | | Cristopher Moore,
Daniel N. Rockmore,
Alexander Russell:
Generic quantum Fourier transforms.
ACM Transactions on Algorithms 2(4): 707-723 (2006) |
| 67 | | Cristopher Moore,
Alexander Russell:
On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism
CoRR abs/quant-ph/0609138: (2006) |
| 66 | | Grzegorz Malewicz,
Alexander Russell,
Alexander A. Shvartsman:
Distributed scheduling for disconnected cooperation.
Distributed Computing 18(6): 409-420 (2006) |
| 65 | | Alexander Russell,
Hong Wang:
How to fool an unbounded adversary with a short key.
IEEE Transactions on Information Theory 52(3): 1130-1140 (2006) |
| 64 | | K. Abe,
Justin Bisceglio,
David R. Ferguson,
Thomas J. Peters,
Alexander Russell,
Takis Sakkalis:
Computational topology for isotopic surface reconstruction.
Theor. Comput. Sci. 365(3): 184-198 (2006) |
| 2005 |
|---|
| 63 | | Kishori M. Konwar,
Ion I. Mandoiu,
Alexander Russell,
Alexander A. Shvartsman:
Improved algorithms for multiplex PCR primer set selection with amplification length constraints.
APBC 2005: 41-50 |
| 62 | | Sean Hallgren,
Alexander Russell,
Igor Shparlinski:
Quantum Noisy Rational Function Reconstruction.
COCOON 2005: 420-429 |
| 61 | | Cristopher Moore,
Alexander Russell,
Leonard J. Schulman:
The Symmetric Group Defies Strong Fourier Sampling.
FOCS 2005: 479-490 |
| 60 | | Aggelos Kiayias,
Yona Raekow,
Alexander Russell:
Efficient Steganography with Provable Security Guarantees.
Information Hiding 2005: 118-130 |
| 59 | | K. Abe,
Justin Bisceglio,
Thomas J. Peters,
Alexander Russell,
Takis Sakkalis:
Computational Topology for Reconstruction of Surfaces with Boundary: Integrating Experiments and Theory.
SMI 2005: 290-299 |
| 58 | | Cristopher Moore,
Alexander Russell,
Leonard J. Schulman:
The Symmetric Group Defies Strong Fourier Sampling: Part I
CoRR abs/quant-ph/0501056: (2005) |
| 57 | | Cristopher Moore,
Alexander Russell:
The Symmetric Group Defies Strong Fourier Sampling: Part II
CoRR abs/quant-ph/0501066: (2005) |
| 56 | | Chryssis Georgiou,
Alexander Russell,
Alexander A. Shvartsman:
Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups.
SIAM J. Comput. 34(4): 848-862 (2005) |
| 55 | | Antonio Fernández,
Chryssis Georgiou,
Alexander Russell,
Alexander A. Shvartsman:
The Do-All problem with Byzantine processor failures.
Theor. Comput. Sci. 333(3): 433-454 (2005) |
| 2004 |
|---|
| 54 | | Cristopher Moore,
Daniel N. Rockmore,
Alexander Russell,
Leonard J. Schulman:
The power of basis selection in fourier sampling: hidden subgroup problems in affine groups.
SODA 2004: 1113-1122 |
| 53 | | Cristopher Moore,
Daniel N. Rockmore,
Alexander Russell:
Generic quantum Fourier transforms.
SODA 2004: 778-787 |
| 52 | | Kishori M. Konwar,
Ion I. Mandoiu,
Alexander Russell,
Alexander A. Shvartsman:
Approximation Algorithms for Minimum PCR Primer Set Selection with Amplification Length and Uniqueness Constraints
CoRR cs.DS/0406053: (2004) |
| 51 | | Chryssis Georgiou,
Alexander Russell,
Alexander A. Shvartsman:
The complexity of synchronous iterative Do-All with crashes.
Distributed Computing 17(1): 47-63 (2004) |
| 50 | | Zeph Landau,
Alexander Russell:
Random Cayley Graphs are Expanders: a Simple Proof of the Alon-Roichman Theorem.
Electr. J. Comb. 11(1): (2004) |
| 49 | | Alexander Russell,
Igor Shparlinski:
Classical and quantum function reconstruction via character evaluation.
J. Complexity 20(2-3): 404-422 (2004) |
| 48 | | Chryssis Georgiou,
Alexander Russell,
Alexander A. Shvartsman:
Analysis of memory access concurrency in robust parallel algorithms.
Stud. Inform. Univ. 3(2): 125-150 (2004) |
| 47 | | Lars Engebretsen,
Jonas Holmerin,
Alexander Russell:
Inapproximability results for equations over finite groups.
Theor. Comput. Sci. 312(1): 17-45 (2004) |
| 46 | | Marcos A. Kiwi,
Alexander Russell:
The chilean highway problem.
Theor. Comput. Sci. 326(1-3): 329-342 (2004) |
| 2003 |
|---|
| 45 | | Chryssis Georgiou,
Alexander Russell,
Alexander A. Shvartsman:
Distributed Cooperation and Adversity: Complexity Trade-Offs.
PCK50 2003: 60-71 |
| 44 | | Ravi Kumar,
Alexander Russell:
A note on the set systems used for broadcast encryption.
SODA 2003: 470-471 |
| 43 | | Chryssis Georgiou,
Alexander Russell,
Alexander A. Shvartsman:
Work-competitive scheduling for cooperative computing with dynamic groups.
STOC 2003: 251-258 |
| 42 | | Sean Hallgren,
Alexander Russell,
Amnon Ta-Shma:
The Hidden Subgroup Problem and Quantum Computation Using Group Representations.
SIAM J. Comput. 32(4): 916-934 (2003) |
| 41 | | Nina Amenta,
Thomas J. Peters,
Alexander Russell:
Computational topology: ambient isotopic approximation of 2-manifolds.
Theor. Comput. Sci. 305(1-3): 3-15 (2003) |
| 2002 |
|---|
| 40 | | Alexander Russell,
Hong Wang:
How to Fool an Unbounded Adversary with a Short Key.
EUROCRYPT 2002: 133-148 |
| 39 | | Lars Engebretsen,
Jonas Holmerin,
Alexander Russell:
Inapproximability Results for Equations over Finite Groups.
ICALP 2002: 73-84 |
| 38 | | Eric Allender,
Sanjeev Arora,
Michael S. Kearns,
Cristopher Moore,
Alexander Russell:
A Note on the Representational Incompatibility of Function Approximation and Factored Dynamics.
NIPS 2002: 431-437 |
| 37 | | Chryssis Georgiou,
Alexander Russell,
Alexander A. Shvartsman:
Failure sensitive analysis for parallel algorithm with controlled memory access concurrency.
OPODIS 2002: 125-136 |
| 36 | | Chryssis Georgiou,
Alexander Russell,
Alexander A. Shvartsman:
Optimally work-competitive scheduling for cooperative computing with merging groups.
PODC 2002: 132 |
| 35 | | Cristopher Moore,
Alexander Russell:
Quantum Walks on the Hypercube.
RANDOM 2002: 164-178 |
| 34 | | Alexander Russell,
Alexander A. Shvartsman:
Distributed Computation Meets Design Theory: Local Scheduling for Disconnected Cooperation.
Bulletin of the EATCS 77: 120-131 (2002) |
| 33 | | Lars Engebretsen,
Jonas Holmerin,
Alexander Russell:
Inapproximability Results for Equations over Finite Groups
Electronic Colloquium on Computational Complexity (ECCC)(030): (2002) |
| 32 | | Mikael Goldmann,
Alexander Russell:
The Complexity of Solving Equations over Finite Groups.
Inf. Comput. 178(1): 253-262 (2002) |
| 31 | | Alexander Russell,
Michael E. Saks,
David Zuckerman:
Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model.
SIAM J. Comput. 31(6): 1645-1662 (2002) |
| 2001 |
|---|
| 30 | | Chryssis Georgiou,
Alexander Russell,
Alexander A. Shvartsman:
The Complexity of Synchronous Iterative Do-All with Crashes.
DISC 2001: 151-165 |
| 29 | | Grzegorz Malewicz,
Alexander Russell,
Alexander A. Shvartsman:
Local Scheduling for Distributed Cooperation.
NCA 2001: 244-255 |
| 28 | | Grzegorz Malewicz,
Alexander Russell,
Alexander A. Shvartsman:
Optimal scheduling for disconnected cooperation.
PODC 2001: 305-307 |
| 27 | | Grzegorz Malewicz,
Alexander Russell,
Alexander A. Shvartsman:
Optimal Scheduling for Distributed Cooperation Without Communication.
SIROCCO 2001: 259-274 |
| 26 | | Alexander Russell,
David Zuckerman:
Perfect Information Leader Election in log* n+O (1) Rounds.
J. Comput. Syst. Sci. 63(4): 612-626 (2001) |
| 25 | | Mikael Goldmann,
Mats Näslund,
Alexander Russell:
Complexity Bounds on General Hard-Core Predicates.
J. Cryptology 14(3): 177-195 (2001) |
| 2000 |
|---|
| 24 | | Grzegorz Malewicz,
Alexander Russell,
Alexander A. Shvartsman:
Distributed Cooperation During the Absence of Communication.
DISC 2000: 119-133 |
| 23 | | Chryssis Georgiou,
Alexander Russell,
Alexander A. Shvartsman:
The Complexity of Distributed Cooperation in the Presence of Failures.
OPODIS 2000: 245-264 |
| 22 | | Grzegorz Malewicz,
Alexander Russell,
Alexander A. Shvartsman:
Distributed cooperation in the absence of communication (brief announcement).
PODC 2000: 339 |
| 21 | | Mikael Goldmann,
Alexander Russell:
Spectral Bounds on General Hard Core Predicates.
STACS 2000: 614-625 |
| 20 | | Sean Hallgren,
Alexander Russell,
Amnon Ta-Shma:
Normal subgroup reconstruction and quantum computation using group representations.
STOC 2000: 627-635 |
| 19 | | Marcos A. Kiwi,
Carsten Lund,
Daniel A. Spielman,
Alexander Russell,
Ravi Sundaram:
Alternation in interaction.
Computational Complexity 9(3-4): 202-246 (2000) |
| 18 | | Mats Näslund,
Alexander Russell:
Extraction of optimally unbiased bits from a biased source.
IEEE Transactions on Information Theory 46(3): 1093-1103 (2000) |
| 17 | | Mikael Goldmann,
Alexander Russell,
Denis Thérien:
An ergodic theorem for read-once non-uniform deterministic finite automata.
Inf. Process. Lett. 73(1-2): 23-28 (2000) |
| 1999 |
|---|
| 16 | | Mikael Goldmann,
Alexander Russell:
The Complexity of Solving Equations over Finite Groups.
IEEE Conference on Computational Complexity 1999: 80-86 |
| 15 | | Alexander Russell,
Michael E. Saks,
David Zuckerman:
Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model.
STOC 1999: 339-347 |
| 14 | | Ravi Kumar,
Alexander Russell,
Ravi Sundaram:
Approximating Latin Square Extensions.
Algorithmica 24(2): 128-138 (1999) |
| 1998 |
|---|
| 13 | | Alexander Russell,
David Zuckerman:
Perfect Information Leader Election in log*n + O(1) Rounds.
FOCS 1998: 576-583 |
| 12 | | Alexander Russell,
Ravi Sundaram:
Symmetric Alternation Captures BPP.
Computational Complexity 7(2): 152-162 (1998) |
| 11 | | Michael Klugerman,
Alexander Russell,
Ravi Sundaram:
On embedding complete graphs into hypercubes.
Discrete Mathematics 186(1-3): 289-293 (1998) |
| 10 | | Alexander Russell,
Ravi Sundaram:
A Note on the Asymptotics and Computational Complexity of Graph Distinguishability.
Electr. J. Comb. 5: (1998) |
| 1997 |
|---|
| 9 | | Ravi Kumar,
Alexander Russell,
Ravi Sundaram:
Faster Algorithms for Optical Switch Configuration.
ICC (3) 1997: 1320-1324 |
| 8 | | Ravi Kumar,
Rina Panigrahy,
Alexander Russell,
Ravi Sundaram:
A Note on Optical Routing on Trees.
Inf. Process. Lett. 62(6): 295-300 (1997) |
| 1996 |
|---|
| 7 | | Ravi Kumar,
Alexander Russell,
Ravi Sundaram:
Approximating Latin Square Extensions.
COCOON 1996: 280-289 |
| 1995 |
|---|
| 6 | | Alexander Russell,
Ravi Sundaram:
The Relativized Relationship Between Probabilistically Chackable Debate Systems, IP and PSPACE.
Inf. Process. Lett. 53(2): 61-68 (1995) |
| 5 | | Alexander Russell:
Necessary and Sufficient Condtions for Collision-Free Hashing.
J. Cryptology 8(2): 87-100 (1995) |
| 1994 |
|---|
| 4 | | Mihir Bellare,
Shafi Goldwasser,
Carsten Lund,
Alexander Russell:
Efficient probabilistic checkable proofs and applications to approximation.
STOC 1994: 820 |
| 3 | | Marcos A. Kiwi,
Carsten Lund,
Alexander Russell,
Daniel A. Spielman,
Ravi Sundaram:
Alternation in Interaction.
Structure in Complexity Theory Conference 1994: 294-303 |
| 1992 |
|---|
| 2 | | Alexander Russell:
Necessary and Sufficient Conditions For Collision-Free Hashing.
CRYPTO 1992: 433-441 |
| 1991 |
|---|
| 1 | | Alberto Maria Segre,
Charles Elkan,
Alexander Russell:
A Critical Look at Experimental Evaluations of EBL.
Machine Learning 6: 183-195 (1991) |
