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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Cooperative intervehicular applications rely on the periodic exchange of broadcast single-hop status messages among vehicles… 
Review
2011
Review
2011
In wavelength-switched optical networks (WSONs), quality of transmission (QoT) has to be guaranteed during lightpath provisioning… 
2011
2011
Vélo’v 
2007
2007
Applications to be executed in grid computing environments become more and more complex and usually consist of multiple… 
2004
2004
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
Abstraction is often essential to verify a program with model checking. Typically, a concrete source program with an infinite (or… 
1998
1998
The implementation of software based video/audio decoders is an advantageous solution over traditional dedicated hardware systems… 
1995
1995
Object-oriented view mechanisms have received much attention in the literature in recent years, since they provide powerful… 
1992
1992
  • A. KahngG. Robins
  • 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
In this paper a bidirectional parser for Lexicalized Tree Adjoining Grammars will be presented. The algorithm takes advantage of…