Skip to search formSkip to main contentSkip to account menu

Worst-case complexity

Known as: Worst case complexity 
In computer science, the worst-case complexity (usually denoted in asymptotic notation) measures the resources (e.g. running time, memory) an… 
Wikipedia (opens in a new tab)

Related topics

Related topics

23 relations
Analysis of algorithmsAverage-case complexityBest, worst and average caseComputationally bounded adversary

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Statistical Beaconing Congestion Control for Vehicular Networks
Cooperative intervehicular applications rely on the periodic exchange of broadcast single-hop status messages among vehicles… 
Review
2011
Review
2011
Modeling and Distributed Provisioning in 10–40–100-Gb/s Multirate Wavelength Switched Optical Networks
In wavelength-switched optical networks (WSONs), quality of transmission (QoT) has to be guaranteed during lightpath provisioning… 
2011
2011
Dynamics On and Of Complex Networks V
Vélo’v 
2007
2007
Heuristic Scheduling of Grid Workflows Supporting Co-Allocation and Advance Reservation
Applications to be executed in grid computing environments become more and more complex and usually consist of multiple… 
2004
2004
Scheduling over non-stationary wireless channels with finite rate sets
We consider a wireless basestation transmitting high-speed data to multiple mobile users in a cell. The channel conditions… 
Highly Cited
2004
Highly Cited
2004
The existence of finite abstractions for branching time model checking
Abstraction is often essential to verify a program with model checking. Typically, a concrete source program with an infinite (or… 
1998
1998
Implementing Real-time Video Decoding On Multimedia Processors By Complexity Prediction Techniques
The implementation of software based video/audio decoders is an advantageous solution over traditional dedicated hardware systems… 
1995
1995
Materialized object-oriented views in MultiView
Object-oriented view mechanisms have received much attention in the literature in recent years, since they provide powerful… 
1992
1992
On the performance bounds for a class of rectilinear Steiner tree heuristics in arbitrary dimension
  • A. KahngG. Robins
  • IEEE Trans. Comput. Aided Des. Integr. Circuits…
  • 1992
  • Corpus ID: 17131481
A family of examples on which a large class C of minimum spanning tree-based rectilinear Steiner tree heuristics has a… 
1991
1991
Bidirectional Parsing of Lexicalized Tree Adjoining Grammars
In this paper a bidirectional parser for Lexicalized Tree Adjoining Grammars will be presented. The algorithm takes advantage of… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)