2944 search results - page 449 / 589 » On Well Quasi-orders on Languages |
152
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
A union-find data structure maintains a collection of disjoint sets under makeset, union and find operations. Kaplan, Shafrir and Tarjan [SODA 2002] designed data structures for ...
176
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place...
169
click to vote
ICALP
2005
Springer
15 years 12 months ago
2005
Springer
We prove new lower bounds for locally decodable codes and private information retrieval. We show that a 2-query LDC encoding nbit strings over an ℓ-bit alphabet, where the decode...
175
click to vote
ICLP
2005
Springer
15 years 12 months ago
2005
Springer
Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt ter...
165
click to vote
ICMI
2005
Springer
15 years 12 months ago
2005
Springer
Situated, spontaneous speech may be ambiguous along acoustic, lexical, grammatical and semantic dimensions. To understand such a seemingly difficult signal, we propose to model th...