title: The Complexity of Routing Strategies in Update Networks author:...  Home/Search
Context
Related
| is.titech.ac.jp/research/...C186.ps.gz Cached: PS.gz PS This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PDF Image Update HelpPS.gz PS From: is.titech.ac.jp/research/...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: An update game is a new model for studying networks and infinite duration processes. In this paper we analyze routing strategies in (bipartite) update networks. We show that any routing strategy, both independent of a relying graph and with advice, uses a space of size at least the logarithm of the number of vertices. We also present a nearly optimal strategy with advice to this lower bound. (Update)
Active bibliography (related documents): More All
0.5: Technical Reports on Mathematical and Computing Sciences.. - Title On Routing (Correct)
0.2: Games on Graphs: Automata, Structure, and Complexity - Khoussainov, Kowalski (2002) (Correct)
0.2: Finite State Strategies in One Player McNaughton Games - Khoussainov (2002) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ complexity-technical,
author = "Title The Complexity",
title = "Technical Reports on Mathematical and Computing Sciences: TR-C186",
url = "citeseer.ist.psu.edu/754065.html" }
Citations (may not include all citations):531 The knowledge complexity of interactive proof systems (context) - Goldwasser, Macali et al. - 1985
150 Computational Complexity (context) - Papadimitriou - 1994
4 Update Networks and Their Routing Strategies (context) - Dineer, Khoussainov
2 Update games and Update Networks (context) - Dineer, Khoussainov - 1999
1 Research Reports on Mathematical and Computing Sciences C (context) - Marcel, in et al. - 2003
Documents on the same site (http://www.is.titech.ac.jp/research/research-report/C/index.html): More
Practical Algorithms for On-line Sampling - Domingo, Gavaldà, Watanabe (1998) (Correct)
Unique Solution Instance Generation for the 3-Satisfiability.. - Motoki, Uehara (Correct)
On-Line Sampling Methods for Discovering Association Rules - Domingo, Gavalda, Watanabe (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC