| On the Skolem Problem and the Skolem Conjecture | 0 | 0.34 | 2022 |
| Provably Secure Virus Detection: Using The Observer Effect Against Malware. | 2 | 0.40 | 2016 |
| Towards Provably-Secure Remote Memory Attestation. | 0 | 0.34 | 2015 |
| Simulating Special but Natural Quantum Circuits | 0 | 0.34 | 2012 |
| Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-partite graphs | 1 | 0.35 | 2012 |
| Might Turing Have Won a Turing Award? | 0 | 0.34 | 2012 |
| Best-order streaming model | 6 | 0.50 | 2011 |
| Symmetric functions capture general functions | 0 | 0.34 | 2011 |
| Quantum complexity: some recent results, some open problems, some thoughts | 0 | 0.34 | 2011 |
| Regret-Minimizing Representative Databases. | 0 | 0.34 | 2010 |
| Platform-independent programs | 3 | 0.64 | 2010 |
| Realizable paths and the nl vs l problem | 0 | 0.34 | 2010 |
| Deterministically testing sparse polynomial identities of unbounded degree | 18 | 0.84 | 2009 |
| Algorithms for Modular Counting of Roots of Multivariate Polynomials | 3 | 0.43 | 2008 |
| Polynomials that Sign Represent Parity and Descartes' Rule of Signs | 2 | 0.40 | 2008 |
| Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions | 45 | 2.34 | 2008 |
| Symmetric polynomials over Zm and simultaneous communication protocols | 11 | 0.61 | 2006 |
| Perfectly secure password protocols in the bounded retrieval model | 75 | 3.51 | 2006 |
| On the Fourier Spectrum of Symmetric Boolean Functions with Applications to Learning Symmetric Juntas | 13 | 0.69 | 2005 |
| Intrusion-Resilient Authentication in the Limited Communication Model. | 0 | 0.34 | 2005 |
| Time-space lower bounds for satisfiability | 30 | 1.01 | 2005 |
| Nash Equilibria via Polynomial Equations | 22 | 2.12 | 2004 |
| The Degree of Threshold Mod 6 and Diophantine Equations | 0 | 0.34 | 2004 |
| Mandatory human participation: a new authentication scheme for building secure systems | 7 | 0.63 | 2003 |
| Playing large games using simple strategies | 188 | 13.23 | 2003 |
| Randomized Time-Space Tradeoffs for Directed Graph Connectivity | 1 | 0.37 | 2003 |
| A Note on Square Rooting of Time Functions of Turing Machines | 0 | 0.34 | 2003 |
| Non-uniform Depth of Polynomial Time and Space Simulations | 3 | 0.38 | 2003 |
| Gamma system: continuous evolution of software after deployment | 66 | 5.25 | 2002 |
| Spy: A Method to Secure Clients for Network Services | 5 | 0.45 | 2002 |
| Fidelity of enzymatic ligation for DNA computing. | 1 | 0.35 | 2000 |
| On the complexity of SAT | 21 | 0.93 | 1999 |
| DNA²DNA Computations: A Potential "Killer App"? | 11 | 1.18 | 1997 |
| DNA2DNA Computation: A Potential Killer Application? | 0 | 0.34 | 1997 |
| Making DNA computers error resistant. | 25 | 3.41 | 1996 |
| Clock Buffer Placement Algorithm for Wire-Delay-Dominated Timing Model | 4 | 0.60 | 1996 |
| DNA computations can have global memory | 0 | 0.34 | 1996 |
| Algorithms for Black-Box Fields and their Application to Cryptography (Extended Abstract) | 49 | 13.86 | 1996 |
| Communication Complexity of Key Agreement on Small Ranges | 1 | 0.37 | 1995 |
| Speeding up computations via molecular biology. | 21 | 32.92 | 1995 |
| Simple strategies for large zero-sum games with applications to complexity theory | 35 | 5.09 | 1994 |
| The complexity of the membership problem for 2-generated commutative semigroups of rational matrices | 8 | 0.96 | 1994 |
| PSPACE is provable by two provers in one round | 24 | 8.61 | 1994 |
| Subquadratic Simulations of Balanced Formulae by Branching Programs | 2 | 0.38 | 1994 |
| A New Approach To Information Theory | 27 | 2.14 | 1994 |
| Some Consequences of Our Failure to Prove Non-Linear Lower Bounds on Explicit Functions | 2 | 0.37 | 1994 |
| Clocked Adversaries for Hashing | 9 | 1.50 | 1993 |
| Efficient sampling strategies for relational database operations | 56 | 17.17 | 1993 |
| A Monte-Carlo algorithm for estimating the permanent | 48 | 5.57 | 1993 |
| A class of randomized strategies for low-cost comparison of file copies | 16 | 8.02 | 1991 |
