<--- Back to Details
First PageDocument Content
Circuit complexity / NC / Constructible universe / Net / Ordinal number / Mathematics / Creativity / Abstraction
Date: 2013-11-25 11:02:45
Circuit complexity
NC
Constructible universe
Net
Ordinal number
Mathematics
Creativity
Abstraction

Energy-Efficient Algorithms for Flow Time Minimization Susanne Albers∗ Hiroshi Fujiwara† Topic classification: Algorithms and data structures

Add to Reading List

Source URL: www14.in.tum.de

Download Document from Source Website

File Size: 125,64 KB

Share Document on Facebook

Similar Documents

Overview  Abstraction The Rest

Overview Abstraction The Rest

DocID: 1xW1V - View Document

LMS-Verify Abstraction Without Regret for Verified Systems Programming Nada Amin & Tiark Rompf EPFL & Purdue University

LMS-Verify Abstraction Without Regret for Verified Systems Programming Nada Amin & Tiark Rompf EPFL & Purdue University

DocID: 1xVQq - View Document

SMT Techniques for Fast Predicate Abstraction Shuvendu K. Lahiri1 , Robert Nieuwenhuis2 , and Albert Oliveras2 1

SMT Techniques for Fast Predicate Abstraction Shuvendu K. Lahiri1 , Robert Nieuwenhuis2 , and Albert Oliveras2 1

DocID: 1xVJt - View Document

Predicate Abstraction for Relaxed Memory Models Andrei Dan1 , Yuri Meshman2 , Martin Vechev1 , and Eran Yahav2 1 ETH Zurich {andrei.dan, martin.vechev}@inf.ethz.ch

Predicate Abstraction for Relaxed Memory Models Andrei Dan1 , Yuri Meshman2 , Martin Vechev1 , and Eran Yahav2 1 ETH Zurich {andrei.dan, martin.vechev}@inf.ethz.ch

DocID: 1xVFk - View Document