Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

29

FCT
2005
Springer

favoriteEmaildiscussreport

100views Applied Computing» more FCT 2005»

On the Power of Unambiguity in Alternating Machines

14 years 4 months ago

On the Power of Unambiguity in Alternating Machines

Download ccc.cs.uni-duesseldorf.de

Unambiguity in alternating Turing machines has received considerable attention in the context of analyzing globally-unique games by Aida et al. [ACRW04] and in the design of eﬃcient protocols involving globally-unique games by Crˆasmaru et al. [CGRS04]. This paper explores the power of unambiguity in alternating Turing machines in the following settings:

Holger Spakowski, Rahul Tripathi

Real-time Traffic

Aida Et | FCT 2005 | Globally-unique Games | Turing Machines |

claim paper

Related Content

» Accurate and unambiguous tagtogene mapping in serial analysis of gene expression

» Exploring Alternative Splicing Features Using Support Vector Machines

» Virtual machine power metering and provisioning

» Grid Resource Ontologies and Asymmetric ResourceCorrelation

» Power and energy containers for multicore servers

» Disciplined Methods of Software Specification A Case Study

» MemoryIntensive Benchmarks IRAM vs CacheBased Machines

» On Stateless Multicounter Machines

» Segmenting Brain Tumors with Conditional Random Fields and Support Vector Machines

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	FCT
Authors	Holger Spakowski, Rahul Tripathi

Comments (0)