Sophie Laplante Vis

*	2009
21	EE	Julien Degorre, Marc Kaplan, Sophie Laplante, Jérémie Roland: The Communication Complexity of Non-signaling Distributions. MFCS 2009: 270-281
20	EE	Marc Kaplan, Sophie Laplante: Kolmogorov Complexity and Combinatorial Methods in Communication Complexity. TAMC 2009: 261-270
	2008
19	EE	Marc Kaplan, Sophie Laplante: Kolmogorov complexity and combinatorial methods in communication complexity. Electronic Colloquium on Computational Complexity (ECCC) 15(109): (2008)
18	EE	Sophie Laplante, Frédéric Magniez: Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments. SIAM J. Comput. 38(1): 46-62 (2008)
	2007
17	EE	Sophie Laplante, Richard Lassaigne, Frédéric Magniez, Sylvain Peyronnet, Michel de Rougemont: Probabilistic abstraction for model checking: An approach based on property testing. ACM Trans. Comput. Log. 8(4): (2007)
	2006
16	EE	Sophie Laplante: Lower Bounds Using Kolmogorov Complexity. CiE 2006: 297-306
15	EE	Sophie Laplante, Troy Lee, Mario Szegedy: The Quantum Adversary Method and Classical Formula Size Lower Bounds. Computational Complexity 15(2): 163-196 (2006)
	2005
14	EE	Sophie Laplante, Troy Lee, Mario Szegedy: The Quantum Adversary Method and Classical Formula Size Lower Bounds. IEEE Conference on Computational Complexity 2005: 76-90
	2004
13	EE	Sophie Laplante, Frédéric Magniez: Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments. IEEE Conference on Computational Complexity 2004: 294-304
	2002
12	EE	Sophie Laplante, Richard Lassaigne, Frédéric Magniez, Sylvain Peyronnet, Michel de Rougemont: Probabilistic Abstraction for Model Checking: An Approach Based on Property Testing. LICS 2002: 30-39
	2001
11	EE	Sophie Laplante, Richard Lassaigne, Frédéric Magniez, Sylvain Peyronnet, Michel de Rougemont: Probabilistic abstraction for model checking: An approach based on property testing Electronic Colloquium on Computational Complexity (ECCC) 8(51): (2001)
10		André Berthiaume, Wim van Dam, Sophie Laplante: Quantum Kolmogorov Complexity. J. Comput. Syst. Sci. 63(2): 201-221 (2001)
9	EE	Harry Buhrman, Lance Fortnow, Sophie Laplante: Resource-Bounded Kolmogorov Complexity Revisited. SIAM J. Comput. 31(3): 887-905 (2001)
	2000
8	EE	Harry Buhrman, Sophie Laplante, Peter Bro Miltersen: New Bounds for the Language Compression Problem. IEEE Conference on Computational Complexity 2000: 126-130
7	EE	André Berthiaume, Wim van Dam, Sophie Laplante: Quantum Kolmogorov Complexity. IEEE Conference on Computational Complexity 2000: 240-249
	1999
6	EE	László Babai, Sophie Laplante: Stronger Separations for Random-Self-Reducibility, Rounds, and Advice. IEEE Conference on Computational Complexity 1999: 98-104
	1998
5	EE	Lance Fortnow, Sophie Laplante: Nearly Optimal Language Compression Using Extractors. STACS 1998: 84-93
4		Joan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish V. Naik: On Coherence, Random-Self-Reducibility, and Self-Correction. Computational Complexity 7(2): 174-191 (1998)
	1996
3	EE	Joan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish V. Naik: On Coherence, Random-self-reducibility, and Self-correction. IEEE Conference on Computational Complexity 1996: 59-67
	1995
2		Lance Fortnow, Sophie Laplante: Circuit Lower Bounds à la Kolmogorov. Inf. Comput. 123(1): 121-126 (1995)
	1991
1	EE	Gilles Brassard, Claude Crépeau, Sophie Laplante, Christian Léger: Computationally Convincing Proofs of Knowledge. STACS 1991: 251-262

Coauthor Index

1	László Babai	[6]
2	André Berthiaume	[7] [10]
3	Gilles Brassard	[1]
4	Harry Buhrman	[8] [9]
5	Claude Crépeau	[1]
6	Wim van Dam	[7] [10]
7	Julien Degorre	[21]
8	Joan Feigenbaum	[3] [4]
9	Lance Fortnow	[2] [3] [4] [5] [9]
10	Marc Kaplan	[19] [20] [21]
11	Richard Lassaigne	[11] [12] [17]
12	Troy Lee	[14] [15]
13	Christian Léger	[1]
14	Frédéric Magniez	[11] [12] [13] [17] [18]
15	Peter Bro Miltersen	[8]
16	Ashish V. Naik	[3] [4]
17	Sylvain Peyronnet	[11] [12] [17]
18	Jérémie Roland	[21]
19	Michel de Rougemont	[11] [12] [17]
20	Mario Szegedy	[14] [15]