Results 91 to 100 of about 1,097 (101)
Some of the next articles are maybe not open access.
Random walks, universal traversal sequences, and the complexity of maze problems
20th Annual Symposium on Foundations of Computer Science (sfcs 1979), 1979R. Aleliunas +4 more
semanticscholar +1 more source
Drug–Membrane Permeability across Chemical\nSpace
, 2019 Roberto Menichetti +2 more
openalex +1 more source
Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
International Colloquium on Automata, Languages and Programming, 2009R. Guerraoui, Eric Ruppert
semanticscholar +1 more source
On time versus space and related problems
16th Annual Symposium on Foundations of Computer Science (sfcs 1975), 1975J. Hopcroft, W. Paul, L. Valiant
semanticscholar +1 more source
APCol Systems with Verifier Agents
Int. Conf. on Membrane Computing, 2018Lucie Ciencialová +3 more
semanticscholar +1 more source
Bandwidth constrained NP-Complete problems
Symposium on the Theory of Computing, 1981B. Monien, I. H. Sudborough
semanticscholar +1 more source
Alternating Demon Space Is Closed Under Complement and Other Simulations for Sublogarithmic Space
International Conference on Developments in Language Theory, 2016V. Geffert
semanticscholar +1 more source
VAST 2006 Contest - First Place, Corporate Category Applied Analysis Using nSpace and GeoTime
, 2006 Pascale Proulx +4 more
openalex
NSPACE - An unsupervised clustering algorithm based on discretized marginal distributions
, 1973 D. Eigen, Richard A. Northouse
openalex