MFCS 2005 | Sciweavers

13

MFCS
2005
Springer

111views Theoretical Computer Science» more MFCS 2005»

13 years 10 months ago

We prove several results about the relations between injectivity and surjectivity for sand automata. Moreover, we begin the exploration of the dynamical behavior of sand automata ...

Julien Cervelle, Enrico Formenti, Benoît Mas...

claim paper

Read More »

15

click to vote

MFCS
2005
Springer

91views Theoretical Computer Science» more MFCS 2005»

Regular Sets of Higher-Order Pushdown Stacks

13 years 10 months ago

Download www-igm.univ-mlv.fr

Abstract. It is a well-known result that the set of reachable stack contents in a pushdown automaton is a regular set of words. We consider the more general case of higher-order pu...

Arnaud Carayol

claim paper

Read More »

11

click to vote

MFCS
2005
Springer

138views Theoretical Computer Science» more MFCS 2005»

Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time

13 years 10 months ago

Download www.ime.usp.br

Abstract. Feige and Kilian [5] showed that ﬁnding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...

Julia Böttcher

claim paper

Read More »

11

click to vote

MFCS
2005
Springer

83views Theoretical Computer Science» more MFCS 2005»

Adversarial Queueing Model for Continuous Network Dynamics

13 years 10 months ago

Download gsyc.escet.urjc.es

Maria J. Blesa, Daniel Calzada, Antonio Fern&aacut...

claim paper