13306 search results - page 326 / 2662 » Theoretical Computer Science |
147
click to vote
SOFSEM
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. In this paper we survey some results concerning balls-intobins-games and the power of two choices. We present a unified and rather elementary analysis for models in the p...
166
click to vote
WMP
2000
15 years 10 months ago
2000
orms of Grammars, Finite Automata, Abstract Families, and Closure Properties of Multiset Languages . . . . 135 Manfred Kudlek, Victor Mitrana On Multisets in Database Systems . . ....
168
click to vote
TCS
1998
15 years 6 months ago
1998
The complexity of the reachability problem for live and safe free-choice Petri nets has been open for several years. Several partial results seemed to indicate that the problem is...
166
click to vote
TCS
2010
15 years 5 months ago
2010
This paper concerns learning binary-valued functions defined on IR, and investigates how a particular type of ‘regularity’ of hypotheses can be used to obtain better generali...
147
click to vote
WG
2010
Springer
15 years 5 months ago
2010
Springer
We prove that for sufficiently large n, there exist unit disk graphs on n vertices such that for every representation with disks in the plane at least c √ n bits are needed to wr...