Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Tim Randolph
A Lower Bound on Cycle-Finding in Sparse Digraphs
Related publications
A Lower Bound on Web Services Composition
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
A Lower Bound on Wait-Free Counting
Journal of Algorithms
Finding Frequent Patterns in a Large Sparse Graph
Upper Bound for the Energy of Strongly Connected Digraphs
Applicable Analysis and Discrete Mathematics
Combinatorics
Applied Mathematics
Analysis
Discrete Mathematics
In Search of an Appropriate Lower Bound. The Zero Lower Bound vs. The Positive Lower Bound Under Discretion and Commitment
German Economic Review
Economics
Econometrics
A Polynomial Algorithm for the Hamiltonian Cycle Problem in Semicomplete Multipartite Digraphs
Journal of Graph Theory
Geometry
Topology
A Lower Bound on the Probability of Error in Multihypothesis Testing
IEEE Transactions on Information Theory
Computer Science Applications
Information Systems
Library
Information Sciences
A New Lower Bound on Hadwiger-Debrunner Numbers in the Plane
A Lower Bound for Jumbled Indexing
