Sciweavers

10271 search results - page 628 / 2055
» Computer Science
Sort
View
ICALP
2004
Springer
16 years 21 days ago
Greedy Regular Expression Matching
This paper studies the problem of matching sequences against regular expressions in order to produce structured values.
Alain Frisch, Luca Cardelli
ERSHOV
2003
Springer
16 years 16 days ago
Complexity of Model Checking by Iterative Improvement: The Pseudo-Boolean Framework
We present several new algorithms as well as new lower and upper bounds for optimizing functions underlying infinite games pertinent to computer-aided verification.
Henrik Björklund, Sven Sandberg, Sergei G. Vo...
190
Voted
ICALP
2003
Springer
16 years 16 days ago
The Cell Probe Complexity of Succinct Data Structures
Abstract. We show lower bounds in the cell probe model for the redundancy/query time tradeoff of solutions to static data structure problems.
Anna Gál, Peter Bro Miltersen
SIGCSE
1993
ACM
102views Education» more  SIGCSE 1993»
15 years 11 months ago
The internet programming contest: a report and philosophy
Programming contests can provide a high-profile method for attracting interest in computer science. We describe our philosophy as it pertains to the purpose and merits of program...
Vivek Khera, Owen L. Astrachan, David Kotz
POPL
1990
ACM
15 years 11 months ago
The Chemical Abstract Machine
ical Abstract Machine Introduced in and G. Boudol. The chemical abstract machine. Theoretical Computer Science, 96(1):217
Gérard Berry, Gérard Boudol