Results 91 to 100 of about 1,048 (100)
Some of the next articles are maybe not open access.

Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures

International Colloquium on Automata, Languages and Programming, 2009
R. Guerraoui, Eric Ruppert
semanticscholar   +1 more source

NSPACE - An unsupervised clustering algorithm based on discretized marginal distributions

open access: closed, 1973
D. Eigen, Richard A. Northouse
openalex  

On time versus space and related problems

16th Annual Symposium on Foundations of Computer Science (sfcs 1975), 1975
J. Hopcroft, W. Paul, L. Valiant
semanticscholar   +1 more source

APCol Systems with Verifier Agents

Int. Conf. on Membrane Computing, 2018
Lucie Ciencialová   +3 more
semanticscholar   +1 more source

University of Wisconsin: NSpace: Exploring Architectural Design Principles for a Next-Generation Institutional Repository

open access: closed, 2005
Mike Simpson, Jim Downing
openalex  

Alternating Demon Space Is Closed Under Complement and Other Simulations for Sublogarithmic Space

International Conference on Developments in Language Theory, 2016
V. Geffert
semanticscholar   +1 more source

Bandwidth constrained NP-Complete problems

Symposium on the Theory of Computing, 1981
B. Monien, I. H. Sudborough
semanticscholar   +1 more source

VAST 2006 Contest - First Place, Corporate Category Applied Analysis Using nSpace and GeoTime

open access: closed, 2006
Pascale Proulx   +4 more
openalex  

Evolution of nSpace (2004–2024)

Donnachie, Karen ann   +3 more
openaire   +1 more source

A week mode of space complexity can be used in the proof that [DSPACE(log log n) = NSPACE(log logn)] => [L = NL].

open access: closed, 1990
Andrzej Szepietowski
openalex  
computer science
programming language
mathematics
artificial intelligence
data science
data mining
algorithm
visualization
political science
previous   8  9  10  

Home - About - Disclaimer - Privacy