Combinatorics in Computer Science

Combinatorics in Computer Science (1990)

Cached

Download Links

[www.orie.cornell.edu]

by L. Lovász , D.B. Shmoys , É. Tardos

Citations:

1 - 0 self

BibTeX

@MISC{Lovász90combinatoricsin,
    author = {L. Lovász and D.B. Shmoys and É. Tardos},
    title = {Combinatorics in Computer Science},
    year = {1990}
}

Bookmark

OpenURL

Abstract

Citations

2506	A method for obtaining digital signatures and public-key cryptosystems - Rivest, Shamir, et al.
2292	New Directions in Cryptography - Diffie, Hellman
1001	Probabilistic encryption - Goldwasser, Micali - 1984
892	C.: The knowledge complexity of interactive proof-systems (extended abstract - Goldwasser, Micali, et al. - 1985
644	Data Structures and Algorithms - Aho, Hopcroft, et al. - 1983
533	How to generate cryptographically strong sequences of pseudorandom bits - Blum, Micali - 1984
493	Fibonacci heaps and their uses in improved network optimization algorithms - Fredman, Tarjan - 1987
453	Theory and applications of trapdoor functions - Yao - 1982
303	Gaussian elimination is not optimal - Strassen - 1969
292	L.: A Hard-Core Predicate for all One-Way Functions - Goldreich, Levin - 1989
285	The ellipsoid method and its consequences in combinatorial optimization - Grötschel, Lovász, et al. - 1981
262	Algebraic methods in the theory of lower bounds for Boolean circuit complexity - Smolensky - 1987
213	Almost optimal lower bounds for small depth circuits - H˚astad - 1989
173	Average case complete problems - Levin - 1986
159	Unbiased bits from sources of weak randomness and probabilistic communication complexity - Chor, Goldreich - 1985
156	Handbook of Algorithms and Data Structures - GONNET, R - 1991
147	A.: Proofs that yield nothing but their validity and a methodology of cryptographic protocol design (extended abstract - Goldreich, Micali, et al. - 1986
142	and Avi Wigderson. Monotone circuits for connectivity require super-logarithmic depth - Karchmer - 1990
116	The monotone circuit complexity of boolean functions - Alon, Boppana - 1987
116	Hiding Information and Signatures in Trapdoor knapsacks - Merkle, Hellamn - 1978
115	circuits, and the polynomial time hierarchy - FURST, SAXE, et al.
95	Complexity classes in communication complexity theory (preliminary version - Babai, Frankl, et al. - 1986
88	Sigma 1 formulae on finite structures - Ajtai
88	Lower bounds by probabilistic arguments - YAO - 1983
54	The gap between monotone and nonmonotone circuit complexity is exponential - Tardos - 1988
52	Expressing combinatorial optimization problems by linear programs - Yannakakis - 1991
50	Nontransitive transfer of confidence: a perfect zero-knowledge interactive protocol for SAT and beyond - Brassard, Crepeau - 1986
49	A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystem, in 23rd annual symposium on foundations of computer science - Shamir - 1982
48	Multi-party protocols and logspace-hard pseudorandom sequences - Babai, Nisan, et al. - 1989
46	Fast probabilistic algorithms - Freivalds - 1979
46	Communication Complexity: A Survey - Lovasz - 1990
40	On a method for obtaining lower bounds for the complexity of individual monotone functions - Andreev - 1985
30	Lower bounds for VLSI - Lipton, Sedgewick - 1981
25	On notions of information transfer - Aho, Ullman, et al. - 1983
21	Lattices, Möbius functions and communication complexity - Lovász, Saks - 1988
19	Different Modes of Communication - Halstenberg, Reischuk - 1993
17	On the communication complexity of graph properties - Hajnal, Maass, et al. - 1988
17	Digitalized Signatures as Intractable as Factorization - Rabin - 1979
11	Hadamard determinants, Möbius functions, and the chromatic number of a graph - Wilf - 1968
9	Determinants on semilattices - Lindström - 1969
9	Cryptography. In Handbook of Theoretical Computer Science (Volume A: Algorithms and Complexity - Rivest - 1990
8	bounds on the size of bounded depth circuits over a complete basis with logical addition - Razborov, Lower - 1987
5	Tarjan (1983), Data Structures and Network Algorithms - E
4	interactive proofs, and zero-knowledge { a survey - GOLDREICH - 1988
2	The power of negative thinking in multiplying Boolean matrices. STOC ’74 - Pratt - 1974
1	Interactive proof systems, in: Computational Complexity Theory - Goldwasser - 1989
1	Lattices, Mobius functions and communication - Lov'asz, Saks - 1990
1	Razborov (1985a), Lower bounds on the monotone circuit complexity of some Boolean functions (in - A
1	Razborov (1985b), A lower bound on the monotone network complexity of the logical permanent (in - A - 1985
1	Tarjan (1975), Efficiency of a good but not linear set union algorithm - E