The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Alexander Russell: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. 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]
  4. 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]
  5. Sean Hallgren, Alexander Russell, Igor Shparlinski
    Quantum Noisy Rational Function Reconstruction. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:420-429 [Conf]
  6. Ravi Kumar, Alexander Russell, Ravi Sundaram
    Approximating Latin Square Extensions. [Citation Graph (0, 0)][DBLP]
    COCOON, 1996, pp:280-289 [Conf]
  7. Alexander Russell
    Necessary and Sufficient Conditions For Collision-Free Hashing. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:433-441 [Conf]
  8. 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]
  9. 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]
  10. Alexander Russell, David Zuckerman
    Perfect Information Leader Election in log*n + O(1) Rounds. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:576-583 [Conf]
  11. Lars Engebretsen, Jonas Holmerin, Alexander Russell
    Inapproximability Results for Equations over Finite Groups. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:73-84 [Conf]
  12. Ravi Kumar, Alexander Russell, Ravi Sundaram
    Faster Algorithms for Optical Switch Configuration. [Citation Graph (0, 0)][DBLP]
    ICC (3), 1997, pp:1320-1324 [Conf]
  13. 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]
  14. Aggelos Kiayias, Yona Raekow, Alexander Russell
    Efficient Steganography with Provable Security Guarantees. [Citation Graph (0, 0)][DBLP]
    Information Hiding, 2005, pp:118-130 [Conf]
  15. Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman
    Local Scheduling for Distributed Cooperation. [Citation Graph (0, 0)][DBLP]
    NCA, 2001, pp:244-255 [Conf]
  16. 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]
  17. 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]
  18. 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]
  19. 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]
  20. Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman
    Optimal scheduling for disconnected cooperation. [Citation Graph (0, 0)][DBLP]
    PODC, 2001, pp:305-307 [Conf]
  21. Cristopher Moore, Alexander Russell
    Quantum Walks on the Hypercube. [Citation Graph (0, 0)][DBLP]
    RANDOM, 2002, pp:164-178 [Conf]
  22. 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]
  23. 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]
  24. 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]
  25. Cristopher Moore, Daniel N. Rockmore, Alexander Russell
    Generic quantum Fourier transforms. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:778-787 [Conf]
  26. 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]
  27. Mikael Goldmann, Alexander Russell
    Spectral Bounds on General Hard Core Predicates. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:614-625 [Conf]
  28. 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]
  29. 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]
  30. 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]
  31. 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]
  32. 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]
  33. 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]
  34. 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]
  35. 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]
  36. 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]
  37. Alexander Russell, Ravi Sundaram
    Symmetric Alternation Captures BPP. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1998, v:7, n:2, pp:152-162 [Journal]
  38. 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]
  39. 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]
  40. 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]
  41. 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]
  42. 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]
  43. 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]
  44. 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]
  45. 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]
  46. 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]
  47. 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]
  48. 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]
  49. 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]
  50. 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]
  51. 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]
  52. 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]
  53. 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]
  54. 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]
  55. 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]
  56. 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]
  57. 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]
  58. 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]
  59. 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]
  60. 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]
  61. 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]
  62. 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]
  63. 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]
  64. 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]
  65. 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]
  66. 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]
  67. 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]
  68. 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]
  69. 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]
  70. 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]
  71. 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]
  72. 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]
  73. 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]
  74. 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]

  75. Tampering with Special Purpose Trusted Computing Devices: A Case Study in Optical Scan E-Voting. [Citation Graph (, )][DBLP]


  76. Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs. [Citation Graph (, )][DBLP]


  77. Topological Neighborhoods for Spline Curves: Practice & Theory. [Citation Graph (, )][DBLP]


  78. Implementing a neuromorphic cross-correlation engine with silicon neurons. [Citation Graph (, )][DBLP]


  79. Configuring silicon neural networks using genetic algorithms. [Citation Graph (, )][DBLP]


  80. Randomized Work-Competitive Scheduling for Cooperative Computing on k-partite Task Graphs. [Citation Graph (, )][DBLP]


  81. Distributed cooperation in the absence of communication (brief announcement). [Citation Graph (, )][DBLP]


  82. Taking total control of voting systems: firmware manipulations on an optical scan voting terminal. [Citation Graph (, )][DBLP]


  83. Pre-Election Testing and Post-Election Audit of Optical Scan Voting Terminal Memory Cards. [Citation Graph (, )][DBLP]


  84. Bounds on the Quantum Satisfiability Threshold. [Citation Graph (, )][DBLP]


  85. Randomized Work-Competitive Scheduling for Cooperative Computing on $k$-partite Task Graphs [Citation Graph (, )][DBLP]


  86. Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs [Citation Graph (, )][DBLP]


  87. A simple constant-probability RP reduction from NP to Parity P [Citation Graph (, )][DBLP]


  88. The One-Way Communication Complexity of Group Membership [Citation Graph (, )][DBLP]


  89. Approximating the Permanent via Nonabelian Determinants [Citation Graph (, )][DBLP]


  90. Bounds on the quantum satisfibility threshold [Citation Graph (, )][DBLP]


  91. Efficient Steganography with Provable Security Guarantees [Citation Graph (, )][DBLP]


  92. Randomness-optimal Steganography [Citation Graph (, )][DBLP]


  93. Circuit partitions and #P-complete products of inner products [Citation Graph (, )][DBLP]


  94. How close can we come to a parity function when there isn't one? [Citation Graph (, )][DBLP]


  95. The McEliece Cryptosystem Resists Quantum Fourier Sampling Attacks [Citation Graph (, )][DBLP]


  96. A simple constant-probability RP reduction from NP to Parity P. [Citation Graph (, )][DBLP]


Search in 7.020secs, Finished in 7.024secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002