Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,296 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
23 relations
Analysis of algorithms
Average-case complexity
Best, worst and average case
Computationally bounded adversary
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Statistical Beaconing Congestion Control for Vehicular Networks
E. Egea-López
,
J. Alcaraz
,
J. Vales-Alonso
,
Andreas Festag
,
J. García-Haro
IEEE Transactions on Vehicular Technology
2013
Corpus ID: 16424818
Cooperative intervehicular applications rely on the periodic exchange of broadcast single-hop status messages among vehicles…
Expand
Review
2011
Review
2011
Modeling and Distributed Provisioning in 10–40–100-Gb/s Multirate Wavelength Switched Optical Networks
N. Sambo
,
M. Secondini
,
+4 authors
P. Castoldi
Journal of Lightwave Technology
2011
Corpus ID: 30108904
In wavelength-switched optical networks (WSONs), quality of transmission (QoT) has to be guaranteed during lightpath provisioning…
Expand
2011
2011
Dynamics On and Of Complex Networks V
M. Choudhury
,
Niloy Ganguly
,
+11 authors
Cnrs ENS Lyon
2011
Corpus ID: 995307
Vélo’v
2007
2007
Heuristic Scheduling of Grid Workflows Supporting Co-Allocation and Advance Reservation
Jörg Decker
,
Jörg Schneider
IEEE/ACM International Symposium on Cluster…
2007
Corpus ID: 14463727
Applications to be executed in grid computing environments become more and more complex and usually consist of multiple…
Expand
2004
2004
Scheduling over non-stationary wireless channels with finite rate sets
M. Andrews
,
Lisa Zhang
IEEE Conference on Computer Communications
2004
Corpus ID: 19340582
We consider a wireless basestation transmitting high-speed data to multiple mobile users in a cell. The channel conditions…
Expand
Highly Cited
2004
Highly Cited
2004
The existence of finite abstractions for branching time model checking
D. Dams
,
Kedar S. Namjoshi
Proceedings of the 19th Annual IEEE Symposium on…
2004
Corpus ID: 10225032
Abstraction is often essential to verify a program with model checking. Typically, a concrete source program with an infinite (or…
Expand
1998
1998
Implementing Real-time Video Decoding On Multimedia Processors By Complexity Prediction Techniques
M. Mattavelli
,
S. Brunetton
,
D. Mlynek
International Conference on Consumer Electronics
1998
Corpus ID: 39233879
The implementation of software based video/audio decoders is an advantageous solution over traditional dedicated hardware systems…
Expand
1995
1995
Materialized object-oriented views in MultiView
Harumi A. Kuno
,
Elke A. Rundensteiner
Proceedings RIDE-DOM'95. Fifth International…
1995
Corpus ID: 10646242
Object-oriented view mechanisms have received much attention in the literature in recent years, since they provide powerful…
Expand
1992
1992
On the performance bounds for a class of rectilinear Steiner tree heuristics in arbitrary dimension
A. Kahng
,
G. 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…
Expand
1991
1991
Bidirectional Parsing of Lexicalized Tree Adjoining Grammars
A. Lavelli
,
G. Satta
Conference of the European Chapter of the…
1991
Corpus ID: 1826534
In this paper a bidirectional parser for Lexicalized Tree Adjoining Grammars will be presented. The algorithm takes advantage of…
Expand
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)
ACCEPT & CONTINUE