ICALP
2001
Springer
14 years 1 months ago
2001
Springer
We present a logical framework Υ for reasoning on a very general class of languages featuring binding operators, called nominal , presented in higher-order abstract syntax (HOAS)....
ICALP
2001
Springer
14 years 1 months ago
2001
Springer
ICALP
2001
Springer
14 years 1 months ago
2001
Springer
In contrast to classical offline k-k routing, the online packet routing problem allows for an arbitrary number of packets with arbitrary end points and release times. We study this...
ICALP
2001
Springer
14 years 1 months ago
2001
Springer
ICALP
2001
Springer
14 years 1 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
ICALP
2001
Springer
14 years 1 months ago
2001
Springer
Given an undirected graph with positive edge weights, define Nq(v) for each node v to be the set of q nodes closest to v (including v itself and breaking ties by node ID). It is ...
ICALP
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. We consider the sequence comparison problem, also known as “hidden pattern” problem, where one searches for a given subsequence in a text (rather than a string unders...
ICALP
2001
Springer
14 years 1 months ago
2001
Springer
ICALP
2001
Springer
14 years 1 months ago
2001
Springer
Formal power series are an extension of formal languages. Recognizable formal power series can be captured by the so-called weighted finite automata, generalizing finite state ma...
ICALP
2001
Springer
14 years 1 months ago
2001
Springer
In this paper we initiate the study of testing properties of hypergraphs. The goal of property testing is to distinguish between the case whether a given object has a certain prope...