Theoretical Computer Science

28

click to vote

STACS
2005
Springer

86views Theoretical Computer Science» more STACS 2005»

On the Decidability of Temporal Properties of Probabilistic Pushdown Automata

14 years 6 months ago

Download www.fi.muni.cz

Tomás Brázdil, Antonín Kucera...

claim paper

Read More »

31

click to vote

STACS
2005
Springer

123views Theoretical Computer Science» more STACS 2005»

Centrality Measures Based on Current Flow

14 years 6 months ago

Download i11www.iti.uni-karlsruhe.de

Abstract. We consider variations of two well-known centrality measures, betweenness and closeness, with a diﬀerent model of information spread. Rather than along shortest paths o...

Ulrik Brandes, Daniel Fleischer

claim paper

Read More »

31

click to vote

STACS
2005
Springer

107views Theoretical Computer Science» more STACS 2005»

Speed Scaling to Manage Temperature

14 years 6 months ago

Download students.cs.tamu.edu

Speed scaling is a power management technique that involves dynamically changing the speed of a processor. We study policies for setting the speed of the processor for both of the ...

Nikhil Bansal, Kirk Pruhs

claim paper

Read More »

43

click to vote

STACS
2005
Springer

102views Theoretical Computer Science» more STACS 2005»

Information Theory in Property Testing and Monotonicity Testing in Higher Dimension

14 years 6 months ago

Download www.cs.princeton.edu

In property testing, we are given oracle access to a function f, and we wish to test if the function satisﬁes a given property P, or it is ε-far from having that property. In a...

Nir Ailon, Bernard Chazelle

claim paper

Read More »

30

click to vote

STACS
2005
Springer

110views Theoretical Computer Science» more STACS 2005»

Automorphisms of Finite Rings and Applications to Complexity of Problems

14 years 6 months ago

Download www.cse.iitk.ac.in

Manindra Agrawal, Nitin Saxena

claim paper

Read More »

24

click to vote

STACS
2005
Springer

110views Theoretical Computer Science» more STACS 2005»

All-Pairs Nearly 2-Approximate Shortest-Paths in O(n2 polylog n) Time

14 years 6 months ago

Download www.cse.iitd.ernet.in

Surender Baswana, Vishrut Goyal, Sandeep Sen

claim paper

Read More »

27

click to vote

SPIN
2005
Springer

103views Theoretical Computer Science» more SPIN 2005»

An Incremental Heap Canonicalization Algorithm

14 years 6 months ago

Download research.microsoft.com

Abstract. The most expensive operation in explicit state model checking is the hash computation required to store the explored states in a hash table. One way to reduce this comput...

Madanlal Musuvathi, David L. Dill

claim paper

Read More »

32

click to vote

SPIN
2005
Springer

104views Theoretical Computer Science» more SPIN 2005»

Model Checking Machine Code with the GNU Debugger

14 years 6 months ago

Download www.spinroot.com

Embedded software veriﬁcation is an important veriﬁcation problem that requires the ability to reason about the timed semantics of concurrent behaviors at a low level of atomic...

Eric Mercer, Michael Jones

claim paper

Read More »

29

click to vote

SPIN
2005
Springer

108views Theoretical Computer Science» more SPIN 2005»

SPLAT: A Tool for Model-Checking and Dynamically-Enforcing Abstractions

14 years 6 months ago