2485 search results - page 184 / 497 » Time Bounded Frequency Computations |
175
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Reachability and distance computation are known to be NL-complete in general graphs, but within UL co-UL if the graphs are planar. However, finding longest paths is known to be N...
154
click to vote
MOBIHOC
2009
ACM
16 years 7 months ago
2009
ACM
We address the problem of jamming-resistant communication in scenarios in which the communicating parties do not share secret keys. This includes scenarios where the communicating...
177
click to vote
TCS
2008
15 years 6 months ago
2008
In this paper, we consider smooth words over 2-letter alphabets {a, b}, where a, b are integers having same parity, with 0 < a < b. We show that all are recurrent and that t...
155
click to vote
CIKM
2011
Springer
14 years 6 months ago
2011
Springer
Typically, users interact with database systems by formulating queries. However, many times users do not have a clear understanding of their information needs or the exact content...
180
click to vote
STACS
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. It is well-known that no classical algorithm can solve exactly (i.e., in bounded time without error) the leader election problem in anonymous networks. This paper propose...