50 search results - page 10 / 10 » Languages with Bounded Multiparty Communication Complexity |
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
STOC
2010
ACM
13 years 9 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database...
TACAS
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. We describe a scalable incomplete boundedness test for the communication buffers in UML RT models. UML RT is a variant of the UML modeling language, tailored to describin...
ATAL
2009
Springer
13 years 11 months ago
2009
Springer
This paper argues that the agent-based simulation approach is just the one appropriate to the social sciences (including economics). Although there were many predecessor approache...