30 search results - page 4 / 6 » ccr 1999 |
COCO
1999
Springer
13 years 10 months ago
1999
Springer
Recent work by Bernasconi, Damm and Shparlinski showed that the set of square-free numbers is not in AC0 , and raised as an open question whether similar (or stronger) lower bound...
CORR
1999
Springer
13 years 5 months ago
1999
Springer
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
CCR
1999
13 years 5 months ago
1999
Abstract-RSVP has been designed to support resource reservation in the Internet. However, it has two major problems: complexity and scalability. The former results in large message...
GD
1998
Springer
13 years 10 months ago
1998
Springer
We define the geometric thickness of a graph to be the smallest number of layers such that we can draw the graph in the plane with straightline edges and assign each edge to a lay...
FOSSACS
1999
Springer
13 years 10 months ago
1999
Springer
This paper presents a mu-calculus-based modal logic for describing properties of reactive probabilistic labeled transition systems (RPLTSs) and develops a modelchecking algorithm ...