Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Geoff W. Hamilton
Tight Worst-Case Bounds for Polynomial Loop Programs
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Related publications
Tight Performance Bounds in the Worst-Case Analysis of Feed-Forward Networks
Discrete Event Dynamic Systems: Theory and Applications
Control
Electronic Engineering
Systems Engineering
Simulation
Electrical
Modeling
Structural Graph Matching With Polynomial Bounds on Memory and on Worst-Case Effort
On Domain-Partitioning Induction Criteria: Worst-Case Bounds for the Worst-Case Based
Theoretical Computer Science
Computer Science
Theoretical Computer Science
Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
SIAM Journal on Computing
Mathematics
Computer Science
Worst-Case Large Deviations Upper Bounds for i.i.d. Sequencesunder Ambiguity
Turkish Journal of Mathematics
Mathematics
Tight Bounds for Adopt-Commit Objects
Theory of Computing Systems
Computational Theory
Theoretical Computer Science
Mathematics
Tight Bounds for Parallel Randomized Load Balancing
Nearly Tight Bounds for Testing Function Isomorphism
Tight Approximation Bounds for Greedy Frugal Coverage Algorithms
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
