Automata, Languages and Programming - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

62

(FIVE YEARS 0)

H-INDEX

13

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642141645, 9783642141652

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Orientability of Random Hypergraphs and the Power of Multiple Choices

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-642-14165-2_30 ◽

2010 ◽

pp. 348-359 ◽

Author(s):

Nikolaos Fountoulakis ◽

Konstantinos Panagiotou

Keyword(s):

Random Hypergraphs

Download Full-text

The Positive Semidefinite Grothendieck Problem with Rank Constraint

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-642-14165-2_4 ◽

2010 ◽

pp. 31-42 ◽

Author(s):

Jop Briët ◽

Fernando Mário de Oliveira Filho ◽

Frank Vallentin

Keyword(s):

Positive Semidefinite ◽

Rank Constraint

Download Full-text

On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-642-14165-2_35 ◽

2010 ◽

pp. 408-419 ◽

Author(s):

Amir Shpilka ◽

Ilya Volkovich

Keyword(s):

Polynomial Identity ◽

Polynomial Identity Testing ◽

Identity Testing

Download Full-text

Preprocessing of Min Ones Problems: A Dichotomy

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-642-14165-2_55 ◽

2010 ◽

pp. 653-665 ◽

Author(s):

Stefan Kratsch ◽

Magnus Wahlström

Download Full-text

Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-642-14165-2_22 ◽

2010 ◽

pp. 250-261 ◽

Author(s):

Nikhil Bansal ◽

Subhash Khot

Keyword(s):

Vertex Cover ◽

Scheduling Problems

Download Full-text

From Secrecy to Soundness: Efficient Verification via Secure Computation

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-642-14165-2_14 ◽

2010 ◽

pp. 152-163 ◽

Author(s):

Benny Applebaum ◽

Yuval Ishai ◽

Eyal Kushilevitz

Keyword(s):

Secure Computation ◽

Efficient Verification

Download Full-text

Choosing, Agreeing, and Eliminating in Communication Complexity

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-642-14165-2_39 ◽

2010 ◽

pp. 451-462 ◽

Author(s):

Amos Beimel ◽

Sebastian Ben Daniel ◽

Eyal Kushilevitz ◽

Enav Weinreb

Keyword(s):

Communication Complexity

Download Full-text

A Sublogarithmic Approximation for Highway and Tollbooth Pricing

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-642-14165-2_49 ◽

2010 ◽

pp. 582-593 ◽

Author(s):

Iftah Gamzu ◽

Danny Segev

Download Full-text

Covering and Packing in Linear Space

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-642-14165-2_61 ◽

2010 ◽

pp. 727-737 ◽

Author(s):

Andreas Björklund ◽

Thore Husfeldt ◽

Petteri Kaski ◽

Mikko Koivisto

Keyword(s):

Download Full-text

Plane Spanners of Maximum Degree Six

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/978-3-642-14165-2_3 ◽

2010 ◽

pp. 19-30 ◽

Author(s):

Nicolas Bonichon ◽

Cyril Gavoille ◽

Nicolas Hanusse ◽

Ljubomir Perković

Keyword(s):

Download Full-text