STACS 2003
暂无分享,去创建一个
J. Hartmanis | J. van | J. Hartmanis | J. Van
[1] E. Kushilevitz,et al. Communication Complexity: Basics , 1996 .
[2] Janos Simon,et al. Probabilistic Communication Complexity , 1986, J. Comput. Syst. Sci..
[3] John H. Reif,et al. Symmetric Complementation , 1984, JACM.
[4] Jerzy Tiuryn,et al. Satisfiability of Inequalities in a Poset , 1996, Fundam. Informaticae.
[5] Rolf H. Möhring,et al. Computationally Tractable Classes of Ordered Sets , 1989 .
[6] Thomas J. Schaefer,et al. The complexity of satisfiability problems , 1978, STOC.
[7] N. M. Korobov. Exponential Sums and their Applications , 1992 .
[8] Peter Sanders,et al. Reconciling simplicity and realism in parallel disk models , 2001, SODA '01.
[9] Igor E. Shparlinski,et al. On Polynomial Approximation of the Discrete Logarithm and the Diffie—Hellman Mapping , 2015, Journal of Cryptology.
[10] Edward P. K. Tsang,et al. Foundations of constraint satisfaction , 1993, Computation in cognitive science.
[11] Rolf H. Möhring,et al. Scheduling series-parallel orders subject to 0/1-communication delays , 1999, Parallel Comput..
[12] László Zádori. Posets, near unanimity functions and zigzags , 1993, Bulletin of the Australian Mathematical Society.
[13] Ronen Shaltiel. Towards proving strong direct product theorems , 2003, computational complexity.
[14] Jürgen Forster. A linear lower bound on the unbounded error probabilistic communication complexity , 2002, J. Comput. Syst. Sci..
[15] Jeffrey D. Uuman. Principles of database and knowledge- base systems , 1989 .
[16] Philippe Flajolet,et al. Average-Case Analysis of Algorithms and Data Structures , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[17] Robert E. Tarjan,et al. Self-adjusting binary search trees , 1985, JACM.
[18] Peter Sanders. Asynchronous Scheduling of Redundant Disk Arrays , 2003, IEEE Trans. Computers.
[19] Satyanarayana V. Lokam,et al. Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity , 2001, FSTTCS.
[20] Igor E. Shparlinski,et al. Number Theoretic Methods in Cryptography , 1999 .
[21] Christos H. Papadimitriou,et al. Symmetric Space-Bounded Computation , 1982, Theor. Comput. Sci..
[22] Ugo Montanari,et al. Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..
[23] Noam Nisan,et al. Symmetric logspace is closed under complement , 1995, STOC '95.
[24] Benoît Larose,et al. Algebraic properties and dismantlability of finite posets , 1997, Discret. Math..
[25] Igor E. Shparlinski. Communication Complexity and Fourier Coefficients of the Diffie-Hellman Key , 2000, LATIN.
[26] Eike Kiltz,et al. On the Representation of Boolean Predicates of the Diffie-Hellman Function , 2003, STACS.
[27] Gábor Kun,et al. Order Varieties and Monotone Retractions of Finite Posets , 2001, Order.
[28] Arne Winterhof,et al. A note on the interpolation of the Diffie-Hellman mapping , 2001 .
[29] Peter Sanders,et al. Fast Concurrent Access to Parallel Disks , 2000, SODA '00.
[30] Ivan Rival,et al. Clones, order varieties, near unanimity functions and holes , 1990 .
[31] Dan Boneh,et al. The Decision Diffie-Hellman Problem , 1998, ANTS.
[32] Pascal Weil,et al. Series-Parallel Posets: Algebra, Automata and Languages , 1998, STACS.
[33] Eugene L. Lawler,et al. The recognition of Series Parallel digraphs , 1979, SIAM J. Comput..
[34] Tanja Lange,et al. Polynomial Interpolation of the Elliptic Curve and XTR Discrete Logarithm , 2002, COCOON.