16 search results - page 2 / 4 » latin 1998 |
COMBINATORICS
1998
13 years 5 months ago
1998
LATIN
1998
Springer
13 years 9 months ago
1998
Springer
The problem of approximate pattern matching on hypertext is de ned and solved by Amir et al. in O(m(nlogm + e)) time, where m is the length of the pattern, n is the total text size...
LATIN
1998
Springer
13 years 9 months ago
1998
Springer
We study the performance of packet routing on arrays (or meshes) with bounded buffers in the routing switches, assuming that new packets are continuously inserted at all the nodes....
LATIN
1998
Springer
13 years 9 months ago
1998
Springer
One of the long-standing open questions in the theory of parallel computation is the parallel complexity of the integer gcd and related problems, such as modular inversion. We pres...
ELPUB
1998
ACM
13 years 9 months ago
1998
ACM
One of the often overlooked aspects of the today’s electronic information spread is that not all people use the Latin alphabet for writing, and even those who use it do not use ...