Sciweavers

644 search results - page 4 / 129
» Precedence Automata and Languages
Sort
View
ICALP
2001
Springer
13 years 12 months ago
On the Approximability of Average Completion Time Scheduling under Precedence Constraints
Abstract. We consider the scheduling problem of minimizing the average weighted job completion time on a single machine under precedence constraints. We show that this problem with...
Gerhard J. Woeginger
KBSE
2006
IEEE
14 years 1 months ago
Detecting Precedence-Related Advice Interference
Aspect-Oriented Programming (AOP) has been proposed in literature to overcome modularization shortcomings such as the tyranny of the dominant decomposition. However, the new langu...
Maximilian Storzer, Florian Forster
STOC
2005
ACM
85views Algorithms» more  STOC 2005»
14 years 7 months ago
Tree-walking automata do not recognize all regular languages
Mikolaj Bojanczyk, Thomas Colcombet
CRYPTO
2012
Springer
327views Cryptology» more  CRYPTO 2012»
11 years 9 months ago
Functional Encryption for Regular Languages
We provide a functional encryption system that supports functionality for regular languages. In our system a secret key is associated with a Deterministic Finite Automata (DFA) M....
Brent Waters
FCT
2007
Springer
14 years 1 months ago
On Notions of Regularity for Data Languages
Abstract. Motivated by considerations in XML theory and model checking, data strings have been introduced as an extension of finite alphabet strings which carry, at each position,...
Henrik Björklund, Thomas Schwentick