The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sophie Laplante: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  18. Non-Local Box Complexity and Secure Function Evaluation. [Citation Graph (, )][DBLP]


  19. The Communication Complexity of Non-signaling Distributions. [Citation Graph (, )][DBLP]


  20. Kolmogorov Complexity and Combinatorial Methods in Communication Complexity. [Citation Graph (, )][DBLP]


  21. Kolmogorov complexity and combinatorial methods in communication complexity. [Citation Graph (, )][DBLP]


Search in 0.033secs, Finished in 0.034secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002