Search results for "Sophie Laplante"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao	Lower bounds on information complexity via zero-communication protocols and applications.	Electronic Colloquium on Computational Complexity (ECCC)	2012	DBLP BibTeX RDF
1	Sophie Laplante, Virginie Lerays, Jérémie Roland	Classical and quantum partition bound and detector inefficiency.	Electronic Colloquium on Computational Complexity (ECCC)	2012	DBLP BibTeX RDF
1	Sophie Laplante, Virginie Lerays, Jérémie Roland	Classical and quantum partition bound and detector inefficiency	CoRR	2012	DBLP BibTeX RDF
1	Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao	Lower bounds on information complexity via zero-communication protocols and applications	CoRR	2012	DBLP BibTeX RDF
1	Marc Kaplan, Sophie Laplante	Kolmogorov complexity and combinatorial methods in communication complexity.	Theor. Comput. Sci.	2011	DBLP DOI BibTeX RDF
1	Julien Degorre, Marc Kaplan, Sophie Laplante, Jérémie Roland	The communication complexity of non-signaling distributions.	Quantum Information & Computation	2011	DBLP BibTeX RDF
1	Marc Kaplan, Sophie Laplante, Iordanis Kerenidis, Jérémie Roland	Non-local box complexity and secure function evaluation.	Quantum Information & Computation	2011	DBLP BibTeX RDF
1	Gilles Brassard, Peter Høyer, Kassem Kalach, Marc Kaplan, Sophie Laplante, Louis Salvail	Merkle Puzzles in a Quantum World.	CRYPTO	2011	DBLP DOI BibTeX RDF
1	Marc Kaplan, Sophie Laplante	Kolmogorov Complexity and Combinatorial Methods in Communication Complexity.	TAMC	2009	DBLP DOI BibTeX RDF
1	Julien Degorre, Marc Kaplan, Sophie Laplante, Jérémie Roland	The Communication Complexity of Non-signaling Distributions.	MFCS	2009	DBLP DOI BibTeX RDF
1	Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, Jérémie Roland	Non-Local Box Complexity and Secure Function Evaluation.	FSTTCS	2009	DBLP DOI BibTeX RDF
1	Marc Kaplan, Sophie Laplante	Kolmogorov complexity and combinatorial methods in communication complexity.	Electronic Colloquium on Computational Complexity (ECCC)	2008	DBLP BibTeX RDF
1	Sophie Laplante, Frédéric Magniez	Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments.	SIAM J. Comput.	2008	DBLP DOI BibTeX RDF
1	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.	2007	DBLP DOI BibTeX RDF	Approximate verification, probabilistic abstraction, model checking, property testing, probabilistic verification
1	Sophie Laplante, Troy Lee, Mario Szegedy	The Quantum Adversary Method and Classical Formula Size Lower Bounds.	Computational Complexity	2006	DBLP DOI BibTeX RDF	68Q30, Subject classification. 68Q17
1	Sophie Laplante	Lower Bounds Using Kolmogorov Complexity.	CiE	2006	DBLP DOI BibTeX RDF
1	Sophie Laplante, Troy Lee, Mario Szegedy	The Quantum Adversary Method and Classical Formula Size Lower Bounds.	IEEE Conference on Computational Complexity	2005	DBLP DOI BibTeX RDF
1	Sophie Laplante, Frédéric Magniez	Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments.	IEEE Conference on Computational Complexity	2004	DBLP DOI BibTeX RDF
1	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	DBLP DOI BibTeX RDF
1	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)	2001	DBLP BibTeX RDF
1	André Berthiaume, Wim van Dam, Sophie Laplante	Quantum Kolmogorov Complexity.	J. Comput. Syst. Sci.	2001	DBLP DOI BibTeX RDF
1	Harry Buhrman, Lance Fortnow, Sophie Laplante	Resource-Bounded Kolmogorov Complexity Revisited.	SIAM J. Comput.	2001	DBLP DOI BibTeX RDF
1	André Berthiaume, Wim van Dam, Sophie Laplante	Quantum Kolmogorov Complexity. (PDF / PS)	IEEE Conference on Computational Complexity	2000	DBLP DOI BibTeX RDF	data compression, information theory, quantum computation, Kolmogorov complexity, quantum information theory
1	Harry Buhrman, Sophie Laplante, Peter Bro Miltersen	New Bounds for the Language Compression Problem. (PDF / PS)	IEEE Conference on Computational Complexity	2000	DBLP DOI BibTeX RDF
1	László Babai, Sophie Laplante	Stronger Separations for Random-Self-Reducibility, Rounds, and Advice. (PDF / PS)	IEEE Conference on Computational Complexity	1999	DBLP DOI BibTeX RDF
1	Joan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish V. Naik	On Coherence, Random-Self-Reducibility, and Self-Correction.	Computational Complexity	1998	DBLP DOI BibTeX RDF
1	Lance Fortnow, Sophie Laplante	Nearly Optimal Language Compression Using Extractors.	STACS	1998	DBLP DOI BibTeX RDF	Topics Computational and structural complexity, Kolmogorov complexity
1	Joan Feigenbaum, Lance Fortnow, Sophie Laplante, Ashish V. Naik	On Coherence, Random-self-reducibility, and Self-correction. (PDF / PS)	IEEE Conference on Computational Complexity	1996	DBLP DOI BibTeX RDF	self-correctability, random-self-reducibility, polynomial advice, adaptive versus nonadaptive oracle machines, Computational complexity, coherence, Kolmogorov complexity
1	Lance Fortnow, Sophie Laplante	Circuit Lower Bounds à la Kolmogorov.	Inf. Comput.	1995	DBLP DOI BibTeX RDF
1	Gilles Brassard, Claude Crépeau, Sophie Laplante, Christian Léger	Computationally Convincing Proofs of Knowledge.	STACS	1991	DBLP DOI BibTeX RDF

Publications of "Sophie Laplante" ( http://dblp.L3S.de/Authors/Sophie_Laplante )