Algorithms for media

Authors:
David Eppstein;Jean-Claude Falmagne
Affiliations:
Computer Science Department, University of California, Irvine, Irvine, CA 92697, USA;Department of Cognitive Sciences, University of California, Irvine, Irvine, CA 92697, USA
Venue:
Discrete Applied Mathematics
Year:
2008

Citing 15
Cited 2

Generating binary trees of bounded height

Acta Informatica
Are search and decision programs computationally equivalent?

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Reset sequences for monotonic automata

SIAM Journal on Computing
Reverse search for enumeration

Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Stochastic token theory

Journal of Mathematical Psychology
Well-graded families of relations

Discrete Mathematics
On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine

Journal of the ACM (JACM)
Generating all the acyclic orientations of an undirected graph

Information Processing Letters
Advances in media theory

International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Center and diameter problems in plane triangulations and quadrangulations

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Knowledge Spaces

Knowledge Spaces
Media theory

Discrete Applied Mathematics
The lattice dimension of a graph

European Journal of Combinatorics
Media theory: Representations and examples

Discrete Applied Mathematics
Algorithms for drawing media

GD'04 Proceedings of the 12th international conference on Graph Drawing

Stochastic applications of media theory: Random walks on weak orders or partial orders

Discrete Applied Mathematics
Media theory: Representations and examples

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

Falmagne recently introduced the concept of a medium, a combinatorial object encompassing hyperplane arrangements, topological orderings, acyclic orientations, and many other familiar structures. We find efficient solutions for several algorithmic problems on media: finding short reset sequences, shortest paths, testing whether a medium has a closed orientation, and listing the states of a medium given a black-box description.