11345 search results - page 1834 / 2269 » Foundations of Computer Science |
186
Voted
FOCS
1997
IEEE
15 years 11 months ago
1997
IEEE
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...
179
click to vote
MFCS
1998
Springer
15 years 11 months ago
1998
Springer
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...
179
click to vote
STACS
1998
Springer
15 years 11 months ago
1998
Springer
d Abstract appeared in STACS `98) Joel H. Spencer1 and Katherine St. John2 1 Courant Institute, New York University, New York, NY 10012 2 Department of Mathematics, Santa Clara Uni...
188
Voted
WG
1998
Springer
15 years 11 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
214
Voted
TLCA
1997
Springer
15 years 11 months ago
1997
Springer
We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by ...