|... definitions and basic results of discrete
|Basics in Discrete Complexity Theory
Basics in Discrete Complexity Theory
|theory, in particular, regarding the ...
|... This survey includes principal results on
|Inductive inference of recursive functions: Complexity bounds
Inductive inference of recursive functions: Complexity bounds
Freivalds, Rūsiņš; Bārzdiņš, Jānis; Podnieks, Kārlis
|of inductive inference for recursively ...
|... We consider the communication
|Security with Low Communication Overhead
Security with Low Communication Overhead
Beaver, D.; Feigenbaum, J.; Kilian, J.; Rogaway, P.
|of secure multiparty computations by ...
|... transitions. The first algorithm has time
|Efficient verification of determinate processes
Efficient verification of determinate processes
|O(m+n log n) and space ...
|... the presence of a species richness-habitat
|The effects of habitat complexity on the macroinvertebrates colonising wood substrates in a lowland stream
The effects of habitat complexity on the macroinvertebrates colonising wood substrates in a lowland stream
O'Connor, N. A.
|relationship for macroinvertebrate species ...
|... paper presents a principle of minimum
|A principle of minimum complexity in evolution
A principle of minimum complexity in evolution
Lopez, Luis R.; Caulfield, H. John
|in evolving systems. ...
|... The Ziv-Lempel
|Ziv-Lempel Complexity for Periodic Sequences and its Cryptographic Application
Ziv-Lempel Complexity for Periodic Sequences and its Cryptographic Application
|is a well-known ...
|... 0<n. The quantityt 0 measures theshape-
|Efficient triangulation of simple polygons
Efficient triangulation of simple polygons
|of thetriangulation delivered by the ...
|... simple and well defined operations and
|Space-time complexity in optical computing
Space-time complexity in optical computing
Caulfield, H. J.
|measures, the product of spatial ...
|... We study the linear
|The Linear Complexity Profile and the Jump Complexity of Keystream Sequences
The Linear Complexity Profile and the Jump Complexity of Keystream Sequences
|profile and the jump ...
|... for retrieval. A tradeoff between time
|Storing shortest paths for a polyhedron
Storing shortest paths for a polyhedron
Chen, Jindong; Han, Yijie
|O(d log n/log d) and space ...
|... the next entry to be examined. The
|An Ω(n5/4) lower bound on the randomized complexity of graph properties
An Ω(n5/4) lower bound on the randomized complexity of graph properties
|of a randomized algorithm is the expected ...
|... We are interested in the average case
|Probabilistic leader election on rings of known size
Probabilistic leader election on rings of known size
Abrahamson, Karl; Adler, Andrew; Higham, Lisa; Kirkpatrick, David
|of leader election (and related problems) ...
|... authors have concentrated on the message
|On the computational power needed to elect a leader
On the computational power needed to elect a leader
|, and have disregarded the amount of local ...
|... effect of bit change errors on the linear
|Linear complexity of transformed sequences
Linear complexity of transformed sequences
Fell, Harriet J.
|of finite sequences. ...
|... on the way in which the space
|On problems for which no oracle can help
On problems for which no oracle can help
|in oracle computations is measured) can ...
Klir, George J.
|is perhaps as important a concept for ...
|... is itself a function of any λ-expression.
|What is an efficient implementation of the λ-calculus?
What is an efficient implementation of the λ-calculus?
Frandsen, Gudmund S.; Sturtivant, Carl
|is expressed here as a function of v just ...
|... of messages exchanged (communication
|Communication and time complexity of a distributed election protocol
Communication and time complexity of a distributed election protocol
Jean-Marie, Alain; Baccelli, François
|) and the execution time (time ...
|... whenN is large and whose computational
|The principle of Selecten Jumping Searching andC,C0′,C* algorithms
The principle of Selecten Jumping Searching andC,C0′,C* algorithms
Gao, Q. S.; Li, L. H.
|are exponential by the general searching ...
|... chapter, we investigate the computational
|Ordinary Differentiation Equations
Ordinary Differentiation Equations
|of the solutions y of an ordinary ...
|... There is an enormous literature on the
|Complexity and System Descriptions
Complexity and System Descriptions
|of systems, and with attempts at ...
|... Summary We investigate the message
|On the complexity of computation in the presence of link failures: the case of a ring
On the complexity of computation in the presence of link failures: the case of a ring
Goldreich, Oded; Shrira, Liuba
|of distributed computations on rings of ...
|... Summary Computational
|Contributions to Kinematics, Statics and Dynamics of Multibody Systems Solvable in Linear Computational Complexity
Contributions to Kinematics, Statics and Dynamics of Multibody Systems Solvable in Linear Computational Complexity
Valášek, Michael; Stejskal, Vladimir
|of solution of all problems of multibody ...
|... goals equally efficient, we associate a
|A Formal Approach to Security Architectures
A Formal Approach to Security Architectures
Rueppel, Rainer A.
|parameter to every goal and mechanism. ...