523 search results - page 78 / 105 » Decidability of string graphs |
129
Voted
WAW
2004
Springer
15 years 8 months ago
2004
Springer
d Abstract) Paolo Boldi† Massimo Santini‡ Sebastiano Vigna∗ Deciding which kind of visit accumulates high-quality pages more quickly is one of the most often debated issue i...
166
click to vote
FUIN
2007
15 years 3 months ago
2007
Mazurkiewicz traces form a model for concurrency. Temporal logic st-order logic are important tools in order to deal with the abstract behavior of such systems. Since typical prop...
146
click to vote
TAMC
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...
146
Voted
COMGEO
2012
ACM
13 years 11 months ago
2012
ACM
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...
143
click to vote
ICSE
2001
IEEE-ACM
15 years 7 months ago
2001
IEEE-ACM
Software maintenance costs dominate software engineering costs, partly because most such engineering is done manually. Program Transformation tools leverage an engineer-provided b...