The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Lars Engebretsen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Lars Engebretsen, Jonas Holmerin
    Three-Query PCPs with Perfect Completeness over non-Boolean Domains. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:284-299 [Conf]
  2. Lars Engebretsen, Jonas Holmerin
    Clique Is Hard to Approximate within n1-o(1). [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:2-12 [Conf]
  3. Lars Engebretsen, Jonas Holmerin, Alexander Russell
    Inapproximability Results for Equations over Finite Groups. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:73-84 [Conf]
  4. Lars Engebretsen, Marek Karpinski
    Approximation Hardness of TSP with Bounded Metrics. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:201-212 [Conf]
  5. Lars Engebretsen
    The Non-approximability of Non-Boolean Predicates. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:241-248 [Conf]
  6. Gunnar Andersson, Lars Engebretsen
    Sampling Methods Applied to Dense Instances of Non-Boolean Optimization Problems. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1998, pp:357-368 [Conf]
  7. Lars Engebretsen, Venkatesan Guruswami
    Is Constraint Satisfaction Over Two Variables Always Easy? [Citation Graph (0, 0)][DBLP]
    RANDOM, 2002, pp:224-238 [Conf]
  8. Gunnar Andersson, Lars Engebretsen, Johan Håstad
    A New Way to Use Semidefinite Programming with Applications to Linear Equations mod p. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:41-50 [Conf]
  9. Lars Engebretsen, Piotr Indyk, Ryan O'Donnell
    Derandomized dimensionality reduction with applications. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:705-712 [Conf]
  10. Lars Engebretsen, Madhu Sudan
    Harmonic broadcasting is optimal. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:431-432 [Conf]
  11. Lars Engebretsen
    An Explicit Lower Bound for TSP with Distances One and Two. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:373-382 [Conf]
  12. Lars Engebretsen, Jonas Holmerin
    More Efficient Queries in PCPs for NP and Improved Approximation Hardness of Maximum CSP. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:194-205 [Conf]
  13. Lars Engebretsen
    An Explicit Lower Bound for TSP with Distances One and Two. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:35, n:4, pp:301-318 [Journal]
  14. Lars Engebretsen, Marek Karpinski
    Approximation Hardness of TSP with Bounded Metrics [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:89, pp:- [Journal]
  15. Lars Engebretsen, Jonas Holmerin
    Towards Optimal Lower Bounds For Clique and Chromatic Number [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:3, pp:- [Journal]
  16. Lars Engebretsen
    Lower Bounds for non-Boolean Constraint Satisfaction [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:42, pp:- [Journal]
  17. Lars Engebretsen, Jonas Holmerin, Alexander Russell
    Inapproximability Results for Equations over Finite Groups [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:030, pp:- [Journal]
  18. Lars Engebretsen, Jonas Holmerin
    Three-Query PCPs with Perfect Completeness over non-Boolean Domains [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:040, pp:- [Journal]
  19. Lars Engebretsen, Venkatesan Guruswami
    Is Constraint Satisfaction Over Two Variables Always Easy? [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:053, pp:- [Journal]
  20. Lars Engebretsen
    An Explicit Lower Bound for TSP with Distances One and Two [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:46, pp:- [Journal]
  21. Gunnar Andersson, Lars Engebretsen
    Better Approximation Algorithms for SET SPLITTING and NOT-ALL-EQUAL SAT. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:65, n:6, pp:305-311 [Journal]
  22. Lars Engebretsen
    Simplified tight analysis of Johnson's algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:92, n:4, pp:207-210 [Journal]
  23. Gunnar Andersson, Lars Engebretsen, Johan Håstad
    A New Way of Using Semidefinite Programming with Applications to Linear Equations mod p. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:39, n:2, pp:162-204 [Journal]
  24. Lars Engebretsen, Marek Karpinski
    TSP with bounded metrics. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:4, pp:509-546 [Journal]
  25. Lars Engebretsen, Madhu Sudan
    Harmonic broadcasting is bandwidth-optimal assuming constant bit rate. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:47, n:3, pp:172-177 [Journal]
  26. Gunnar Andersson, Lars Engebretsen
    Property testers for dense constraint satisfaction programs on finite domains. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2002, v:21, n:1, pp:14-32 [Journal]
  27. Lars Engebretsen, Venkatesan Guruswami
    Is constraint satisfaction over two variables always easy? [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:25, n:2, pp:150-178 [Journal]
  28. Lars Engebretsen, Jonas Holmerin
    Three-query PCPs with perfect completeness over non-Boolean domains. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2005, v:27, n:1, pp:46-75 [Journal]
  29. Lars Engebretsen
    The Nonapproximability of Non-Boolean Predicates. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:18, n:1, pp:114-129 [Journal]
  30. Lars Engebretsen
    Platform-independent code conversion within the C++ locale framework. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 2006, v:36, n:15, pp:1643-1654 [Journal]
  31. Lars Engebretsen, Jonas Holmerin
    Towards optimal lower bounds for clique and chromatic number. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:537-584 [Journal]
  32. Lars Engebretsen, Jonas Holmerin, Alexander Russell
    Inapproximability results for equations over finite groups. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:312, n:1, pp:17-45 [Journal]
  33. Lars Engebretsen
    Bipartite multigraphs with expander-like properties. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:13, pp:1667-1677 [Journal]

Search in 0.002secs, Finished in 0.305secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002