4112 search results - page 7 / 823 » Efficient Algorithms for the Spoonerism Problem |
135
Voted
ESOP
2009
Springer
15 years 7 months ago
2009
Springer
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
SODA
2001
ACM
15 years 5 months ago
2001
ACM
139
Voted
ISAAC
1994
Springer
15 years 7 months ago
1994
Springer
We present here an algorithm for detecting (and outputting, if exists) a negative cycle in an n-vertex planar digraph G with real
135
Voted
ICALP
1998
Springer
15 years 7 months ago
1998
Springer
We investigate the problem of finding two nonempty disjoint subsets of a set of n positive integers, with the objective that the sums of the numbers in the two subsets be as close ...