119
click to vote
FUN
2010
Springer
15 years 16 days ago
2010
Springer
In job scheduling with precedence constraints, i j means that job j cannot start being processed before job i is completed. In this paper we consider selfish bully jobs who do no...
EDBT
2010
ACM
15 years 16 days ago
2010
ACM
Suffix trees are indexing structures that enhance the performance of numerous string processing algorithms. In this paper, we propose cache-conscious suffix tree construction algo...
STOC
2010
ACM
15 years 16 days ago
2010
ACM
BIRTHDAY
2010
Springer
15 years 16 days ago
2010
Springer
Given two strings, a pattern P of length m and a text T of length n over some alphabet of size , we consider the exact string matching problem, i.e. we want to report all occurren...
ANTS
2010
Springer
15 years 16 days ago
2010
Springer
ANTS
2010
Springer
15 years 16 days ago
2010
Springer
We extend methods of Greenberg and the author to compute in the cohomology of a Shimura curve defined over a totally real field with arbitrary class number. Via the Jacquet-Langlan...
ANTS
2010
Springer
15 years 16 days ago
2010
Springer
ANTS
2010
Springer
15 years 16 days ago
2010
Springer
ANTS
2010
Springer
15 years 16 days ago
2010
Springer
ANTS
2010
Springer
15 years 16 days ago
2010
Springer
Abstract. This paper revisits a model for elliptic curves over Q introduced by Huff in 1948 to study a diophantine problem. Huff's model readily extends over fields of odd cha...