Universally serializable computation

DOI10.1006/JCSS.1997.1516MaRDI QIDQ1384538zbMATH OpenOpenAlexFDO

Authors Lane A. Hemaspaandra, Ogihara, Mitsunori

Publication date 4 August 1998

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://semanticscholar.org/paper/5ec60335787cce8fc5dc5761db9e8b04f1533022

zbMATH Keywords

PSPACE language

Mathematics Subject Classification ID

Recommendations

• Universally composable synchronous computation
• Generalized theory of serializability
• Global serializability of concurrent programs
• scientific article; zbMATH DE number 4182805
• Universally composable accumulators
• On serializability
• Serialization of concurrent programs
• scientific article; zbMATH DE number 1968604
• Optimally universal parallel computers

Cites work

• scientific article; zbMATH DE number 578252 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1091107 (Why is no real title available?)
• scientific article; zbMATH DE number 3799016 (Why is no real title available?)
• scientific article; zbMATH DE number 3445421 (Why is no real title available?)
• A comparison of polynomial time reducibilities
• Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
• Complexity classes defined by counting quantifiers
• Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy
• Counting classes: Thresholds, parity, mods, and fewness
• Fault-tolerance and complexity (extended abstract)
• ON SERIALIZABLE LANGUAGES
• On Sets with Efficient Implicit Membership Tests
• On sparse hard sets for counting classes
• On the construction of parallel computers from various basis of Boolean functions
• On the power of parity polynomial time
• PP is as Hard as the Polynomial-Time Hierarchy
• PSPACE SURVIVES CONSTANT-WIDTH BOTTLENECKS
• Relativized counting classes: Relations among thresholds, parity, and mods
• STRONG SEPARATIONS FOR THE BOOLEAN HIERARCHY OVER RP
• The Boolean Hierarchy I: Structural Properties
• The Boolean Hierarchy II: Applications
• The complexity of combinatorial problems with succinct input representation
• The complexity of optimization problems
• Turing machines with few accepting computations and low sets for PP
• Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets

Cited in

(4)

• SELF-SPECIFYING MACHINES
• ON SERIALIZABLE LANGUAGES
• Polynomial time machines equipped with word problems over algebraic structures as their acceptance criteria
• Eventually-serializable data services

This page was built for publication: Universally serializable computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1384538)