The SCEAS System
| |||||||

## Search the dblp DataBase
Alexander Russell:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Kishori M. Konwar, Ion I. Mandoiu, Alexander Russell, Alexander A. Shvartsman
**Improved algorithms for multiplex PCR primer set selection with amplification length constraints.**[Citation Graph (0, 0)][DBLP] APBC, 2005, pp:41-50 [Conf] - Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman
**Distributed Cooperation and Adversity: Complexity Trade-Offs.**[Citation Graph (0, 0)][DBLP] PCK50, 2003, pp:60-71 [Conf] - Mikael Goldmann, Alexander Russell
**The Complexity of Solving Equations over Finite Groups.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1999, pp:80-86 [Conf] - Marcos A. Kiwi, Carsten Lund, Alexander Russell, Daniel A. Spielman, Ravi Sundaram
**Alternation in Interaction.**[Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1994, pp:294-303 [Conf] - Sean Hallgren, Alexander Russell, Igor Shparlinski
**Quantum Noisy Rational Function Reconstruction.**[Citation Graph (0, 0)][DBLP] COCOON, 2005, pp:420-429 [Conf] - Ravi Kumar, Alexander Russell, Ravi Sundaram
**Approximating Latin Square Extensions.**[Citation Graph (0, 0)][DBLP] COCOON, 1996, pp:280-289 [Conf] - Alexander Russell
**Necessary and Sufficient Conditions For Collision-Free Hashing.**[Citation Graph (0, 0)][DBLP] CRYPTO, 1992, pp:433-441 [Conf] - Alexander Russell, Hong Wang 0002
**How to Fool an Unbounded Adversary with a Short Key.**[Citation Graph (0, 0)][DBLP] EUROCRYPT, 2002, pp:133-148 [Conf] - Cristopher Moore, Alexander Russell, Leonard J. Schulman
**The Symmetric Group Defies Strong Fourier Sampling.**[Citation Graph (0, 0)][DBLP] FOCS, 2005, pp:479-490 [Conf] - Alexander Russell, David Zuckerman
**Perfect Information Leader Election in log***[Citation Graph (0, 0)][DBLP]*n*+*O*(1) Rounds. FOCS, 1998, pp:576-583 [Conf] - Lars Engebretsen, Jonas Holmerin, Alexander Russell
**Inapproximability Results for Equations over Finite Groups.**[Citation Graph (0, 0)][DBLP] ICALP, 2002, pp:73-84 [Conf] - Ravi Kumar, Alexander Russell, Ravi Sundaram
**Faster Algorithms for Optical Switch Configuration.**[Citation Graph (0, 0)][DBLP] ICC (3), 1997, pp:1320-1324 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] International Conference on Computational Science (2), 2006, pp:758-766 [Conf] - Aggelos Kiayias, Yona Raekow, Alexander Russell
**Efficient Steganography with Provable Security Guarantees.**[Citation Graph (0, 0)][DBLP] Information Hiding, 2005, pp:118-130 [Conf] - Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman
**Local Scheduling for Distributed Cooperation.**[Citation Graph (0, 0)][DBLP] NCA, 2001, pp:244-255 [Conf] - Eric Allender, Sanjeev Arora, Michael S. Kearns, Cristopher Moore, Alexander Russell
**A Note on the Representational Incompatibility of Function Approximation and Factored Dynamics.**[Citation Graph (0, 0)][DBLP] NIPS, 2002, pp:431-437 [Conf] - Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman
**The Complexity of Distributed Cooperation in the Presence of Failures.**[Citation Graph (0, 0)][DBLP] OPODIS, 2000, pp:245-264 [Conf] - Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman
**Failure sensitive analysis for parallel algorithm with controlled memory access concurrency.**[Citation Graph (0, 0)][DBLP] OPODIS, 2002, pp:125-136 [Conf] - Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman
**Optimally work-competitive scheduling for cooperative computing with merging groups.**[Citation Graph (0, 0)][DBLP] PODC, 2002, pp:132- [Conf] - Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman
**Optimal scheduling for disconnected cooperation.**[Citation Graph (0, 0)][DBLP] PODC, 2001, pp:305-307 [Conf] - Cristopher Moore, Alexander Russell
**Quantum Walks on the Hypercube.**[Citation Graph (0, 0)][DBLP] RANDOM, 2002, pp:164-178 [Conf] - Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman
**Optimal Scheduling for Distributed Cooperation Without Communication.**[Citation Graph (0, 0)][DBLP] SIROCCO, 2001, pp:259-274 [Conf] - K. Abe, Justin Bisceglio, Thomas J. Peters, Alexander Russell, Takis Sakkalis
**Computational Topology for Reconstruction of Surfaces with Boundary: Integrating Experiments and Theory.**[Citation Graph (0, 0)][DBLP] SMI, 2005, pp:290-299 [Conf] - Ravi Kumar, Alexander Russell
**A note on the set systems used for broadcast encryption.**[Citation Graph (0, 0)][DBLP] SODA, 2003, pp:470-471 [Conf] - Cristopher Moore, Daniel N. Rockmore, Alexander Russell
**Generic quantum Fourier transforms.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:778-787 [Conf] - Cristopher Moore, Daniel N. Rockmore, Alexander Russell, Leonard J. Schulman
**The power of basis selection in fourier sampling: hidden subgroup problems in affine groups.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:1113-1122 [Conf] - Mikael Goldmann, Alexander Russell
**Spectral Bounds on General Hard Core Predicates.**[Citation Graph (0, 0)][DBLP] STACS, 2000, pp:614-625 [Conf] - Mihir Bellare, Shafi Goldwasser, Carsten Lund, Alexander Russell
**Efficient probabilistic checkable proofs and applications to approximation.**[Citation Graph (0, 0)][DBLP] STOC, 1994, pp:820- [Conf] - Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman
**Work-competitive scheduling for cooperative computing with dynamic groups.**[Citation Graph (0, 0)][DBLP] STOC, 2003, pp:251-258 [Conf] - Sean Hallgren, Cristopher Moore, Martin Rötteler, Alexander Russell, Pranab Sen
**Limitations of quantum coset states for graph isomorphism.**[Citation Graph (0, 0)][DBLP] STOC, 2006, pp:604-617 [Conf] - Sean Hallgren, Alexander Russell, Amnon Ta-Shma
**Normal subgroup reconstruction and quantum computation using group representations.**[Citation Graph (0, 0)][DBLP] STOC, 2000, pp:627-635 [Conf] - Alexander Russell, Michael E. Saks, David Zuckerman
**Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model.**[Citation Graph (0, 0)][DBLP] STOC, 1999, pp:339-347 [Conf] - Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman
**The Complexity of Synchronous Iterative Do-All with Crashes.**[Citation Graph (0, 0)][DBLP] DISC, 2001, pp:151-165 [Conf] - Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman
**Distributed Cooperation During the Absence of Communication.**[Citation Graph (0, 0)][DBLP] DISC, 2000, pp:119-133 [Conf] - Ravi Kumar, Alexander Russell, Ravi Sundaram
**Approximating Latin Square Extensions.**[Citation Graph (0, 0)][DBLP] Algorithmica, 1999, v:24, n:2, pp:128-138 [Journal] - Marcos A. Kiwi, Carsten Lund, Daniel A. Spielman, Alexander Russell, Ravi Sundaram
**Alternation in interaction.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 2000, v:9, n:3-4, pp:202-246 [Journal] - Alexander Russell, Ravi Sundaram
**Symmetric Alternation Captures BPP.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 1998, v:7, n:2, pp:152-162 [Journal] - Zeph Landau, Alexander Russell
**Random Cayley Graphs are Expanders: a Simple Proof of the Alon-Roichman Theorem.**[Citation Graph (0, 0)][DBLP] Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal] - Alexander Russell, Ravi Sundaram
**A Note on the Asymptotics and Computational Complexity of Graph Distinguishability.**[Citation Graph (0, 0)][DBLP] Electr. J. Comb., 1998, v:5, n:, pp:- [Journal] - 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**[Citation Graph (0, 0)][DBLP] CoRR, 2004, v:0, n:, pp:- [Journal] - Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman
**The complexity of synchronous iterative Do-All with crashes.**[Citation Graph (0, 0)][DBLP] Distributed Computing, 2004, v:17, n:1, pp:47-63 [Journal] - Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman
**Distributed scheduling for disconnected cooperation.**[Citation Graph (0, 0)][DBLP] Distributed Computing, 2006, v:18, n:6, pp:409-420 [Journal] - Alexander Russell, Alexander A. Shvartsman
**Distributed Computation Meets Design Theory: Local Scheduling for Disconnected Cooperation.**[Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 2002, v:77, n:, pp:120-131 [Journal] - Lars Engebretsen, Jonas Holmerin, Alexander Russell
**Inapproximability Results for Equations over Finite Groups**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:030, pp:- [Journal] - Mikael Goldmann, Alexander Russell
**The Complexity of Solving Equations over Finite Groups.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 2002, v:178, n:1, pp:253-262 [Journal] - Mikael Goldmann, Alexander Russell, Denis Thérien
**An ergodic theorem for read-once non-uniform deterministic finite automata.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2000, v:73, n:1-2, pp:23-28 [Journal] - Ravi Kumar, Rina Panigrahy, Alexander Russell, Ravi Sundaram
**A Note on Optical Routing on Trees.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:62, n:6, pp:295-300 [Journal] - Alexander Russell, Ravi Sundaram
**The Relativized Relationship Between Probabilistically Chackable Debate Systems, IP and PSPACE.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1995, v:53, n:2, pp:61-68 [Journal] - Alexander Russell, Igor Shparlinski
**Classical and quantum function reconstruction via character evaluation.**[Citation Graph (0, 0)][DBLP] J. Complexity, 2004, v:20, n:2-3, pp:404-422 [Journal] - Alexander Russell, David Zuckerman
**Perfect Information Leader Election in log* n+O (1) Rounds.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2001, v:63, n:4, pp:612-626 [Journal] - Mikael Goldmann, Mats Näslund, Alexander Russell
**Complexity Bounds on General Hard-Core Predicates.**[Citation Graph (0, 0)][DBLP] J. Cryptology, 2001, v:14, n:3, pp:177-195 [Journal] - Alexander Russell
**Necessary and Sufficient Condtions for Collision-Free Hashing.**[Citation Graph (0, 0)][DBLP] J. Cryptology, 1995, v:8, n:2, pp:87-100 [Journal] - Alberto Maria Segre, Charles Elkan, Alexander Russell
**A Critical Look at Experimental Evaluations of EBL.**[Citation Graph (0, 0)][DBLP] Machine Learning, 1991, v:6, n:, pp:183-195 [Journal] - Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman
**Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2005, v:34, n:4, pp:848-862 [Journal] - Sean Hallgren, Alexander Russell, Amnon Ta-Shma
**The Hidden Subgroup Problem and Quantum Computation Using Group Representations.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2003, v:32, n:4, pp:916-934 [Journal] - Alexander Russell, Michael E. Saks, David Zuckerman
**Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2002, v:31, n:6, pp:1645-1662 [Journal] - Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman
**Analysis of memory access concurrency in robust parallel algorithms.**[Citation Graph (0, 0)][DBLP] Stud. Inform. Univ., 2004, v:3, n:2, pp:125-150 [Journal] - Cristopher Moore, Daniel N. Rockmore, Alexander Russell
**Generic quantum Fourier transforms.**[Citation Graph (0, 0)][DBLP] ACM Transactions on Algorithms, 2006, v:2, n:4, pp:707-723 [Journal] - K. Abe, Justin Bisceglio, David R. Ferguson, Thomas J. Peters, Alexander Russell, Takis Sakkalis
**Computational topology for isotopic surface reconstruction.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:365, n:3, pp:184-198 [Journal] - Nina Amenta, Thomas J. Peters, Alexander Russell
**Computational topology: ambient isotopic approximation of 2-manifolds.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2003, v:305, n:1-3, pp:3-15 [Journal] - Lars Engebretsen, Jonas Holmerin, Alexander Russell
**Inapproximability results for equations over finite groups.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2004, v:312, n:1, pp:17-45 [Journal] - Antonio Fernández, Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman
**The Do-All problem with Byzantine processor failures.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2005, v:333, n:3, pp:433-454 [Journal] - Marcos A. Kiwi, Alexander Russell
**The chilean highway problem.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2004, v:326, n:1-3, pp:329-342 [Journal] - Mats Näslund, Alexander Russell
**Extraction of optimally unbiased bits from a biased source.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:1093-1103 [Journal] - Hang T. Dinh, Alexander Russell, Yuan Su
**On the Value of Good Advice: The Complexity of A* Search with Accurate Heuristics.**[Citation Graph (0, 0)][DBLP] AAAI, 2007, pp:1140-1145 [Conf] - Chadi Kari, Yoo Ah Kim, Seungjoon Lee, Alexander Russell, Minho Shin
**Soft Edge Coloring.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2007, pp:189-203 [Conf] - Alex Russell, Garrick Orchard, Ralph Etienne-Cummings
**Configuring of Spiking Central Pattern Generator Networks for Bipedal Walking Using Genetic Algorthms.**[Citation Graph (0, 0)][DBLP] ISCAS, 2007, pp:1525-1528 [Conf] - Gorjan Alagic, Cristopher Moore, Alexander Russell
**Quantum algorithms for Simon's problem over general groups.**[Citation Graph (0, 0)][DBLP] SODA, 2007, pp:1217-1224 [Conf] - Cristopher Moore, Alexander Russell, Piotr Sniady
**On the impossibility of a quantum sieve algorithm for graph isomorphism.**[Citation Graph (0, 0)][DBLP] STOC, 2007, pp:536-545 [Conf] - Cristopher Moore, Alexander Russell
**On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] - Cristopher Moore, Alexander Russell, Leonard J. Schulman
**The Symmetric Group Defies Strong Fourier Sampling: Part I**[Citation Graph (0, 0)][DBLP] CoRR, 2005, v:0, n:, pp:- [Journal] - Cristopher Moore, Alexander Russell
**The Symmetric Group Defies Strong Fourier Sampling: Part II**[Citation Graph (0, 0)][DBLP] CoRR, 2005, v:0, n:, pp:- [Journal] - Michael Klugerman, Alexander Russell, Ravi Sundaram
**On embedding complete graphs into hypercubes.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1998, v:186, n:1-3, pp:289-293 [Journal] - Cristopher Moore, Daniel N. Rockmore, Alexander Russell, Leonard J. Schulman
**The Power of Strong Fourier Sampling: Quantum Algorithms for Affine Groups and Hidden Shifts.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2007, v:37, n:3, pp:938-958 [Journal] **Tampering with Special Purpose Trusted Computing Devices: A Case Study in Optical Scan E-Voting.**[Citation Graph (, )][DBLP]**Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs.**[Citation Graph (, )][DBLP]**Topological Neighborhoods for Spline Curves: Practice & Theory.**[Citation Graph (, )][DBLP]**Implementing a neuromorphic cross-correlation engine with silicon neurons.**[Citation Graph (, )][DBLP]**Configuring silicon neural networks using genetic algorithms.**[Citation Graph (, )][DBLP]**Randomized Work-Competitive Scheduling for Cooperative Computing on k-partite Task Graphs.**[Citation Graph (, )][DBLP]**Distributed cooperation in the absence of communication (brief announcement).**[Citation Graph (, )][DBLP]**Taking total control of voting systems: firmware manipulations on an optical scan voting terminal.**[Citation Graph (, )][DBLP]**Pre-Election Testing and Post-Election Audit of Optical Scan Voting Terminal Memory Cards.**[Citation Graph (, )][DBLP]**Bounds on the Quantum Satisfiability Threshold.**[Citation Graph (, )][DBLP]**Randomized Work-Competitive Scheduling for Cooperative Computing on $k$-partite Task Graphs**[Citation Graph (, )][DBLP]**Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs**[Citation Graph (, )][DBLP]**A simple constant-probability RP reduction from NP to Parity P**[Citation Graph (, )][DBLP]**The One-Way Communication Complexity of Group Membership**[Citation Graph (, )][DBLP]**Approximating the Permanent via Nonabelian Determinants**[Citation Graph (, )][DBLP]**Bounds on the quantum satisfibility threshold**[Citation Graph (, )][DBLP]**Efficient Steganography with Provable Security Guarantees**[Citation Graph (, )][DBLP]**Randomness-optimal Steganography**[Citation Graph (, )][DBLP]**Circuit partitions and #P-complete products of inner products**[Citation Graph (, )][DBLP]**How close can we come to a parity function when there isn't one?**[Citation Graph (, )][DBLP]**The McEliece Cryptosystem Resists Quantum Fourier Sampling Attacks**[Citation Graph (, )][DBLP]**A simple constant-probability RP reduction from NP to Parity P.**[Citation Graph (, )][DBLP]
Search in 0.007secs, Finished in 0.012secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |