Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
linear upper bound
Description:
An upper bound whose magnitude grows at most proportionally to a specified input or problem size in mathematical analysis.
Related topics:
Limits and Structures in Graph Theory (16%),
Advanced Combinatorial Mathematics (10%),
Advanced Graph Theory Research (9%),
Computational Geometry and Mesh Generation (8%)
OpenAlex ID:
keywords/linear-upper-bound
Excluded permutation matrices and the Stanley?Wilf conjecture
2004
·
Adam Marcus
, Gábor Tardos
·
Journal of Combinatorial Theory Series A
·
499
PDF
The Ramsey number of a graph with bounded maximum degree
1983
·
C Chvatál
, V Rödl
, et al.
·
Journal of Combinatorial Theory Series B
·
205
Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs
2009
·
Jakub PrzybyŁo
·
SIAM Journal on Discrete Mathematics
·
107
How many runs can a string contain?
2008
·
Simon J. Puglisi
, Jamie Simpson
, et al.
·
Theoretical Computer Science
·
66
PDF
The Number of Runs in a String: Improved Analysis of the Linear Upper Bound
2006
·
Wojciech Rytter
·
Lecture notes in computer science
·
66
The number of runs in a string
2007
·
Wojciech Rytter
·
Information and Computation
·
57
A linear bound for sliding-block decoder window size
1988
·
J.J. Ashley
·
IEEE Transactions on Information Theory
·
45
Castelnuovo–Mumford Regularity up to Symmetry
2019
·
Dinh Van Le
, Uwe Nagel
, et al.
·
International Mathematics Research Notices
·
40
PDF
Strong Chromatic Index of 2-Degenerate Graphs
2012
·
Gerard Jennhwa Chang
, N. Narayanan
·
Journal of Graph Theory
·
37
Ramsey numbers for sparse graphs
1998
·
Nancy Eaton
·
Discrete Mathematics
·
34
Generalized Davenport-Schinzel sequences with linear upper bound
1992
·
Radek Adamec
, Martin Klazar
, et al.
·
Discrete Mathematics
·
31
On the 1-Wasserstein Distance between Location-Scale Distributions and the Effect of Differential Privacy
2023
·
Chhachhi, Saurab
, Teng, Fei
·
arXiv (Cornell University)
·
22
PDF
On a Problem of Erdos and Lovasz. II: n(r) = O(r)
1994
·
Jeff Kahn
·
Journal of the American Mathematical Society
·
22
PDF
Lenses in arrangements of pseudo-circles and their applications
2002
·
Eran Nevo
, János Pach
, et al.
·
Annual Symposium on Computational Geometry (SoCG)
·
18
PDF
On the subword complexity of locally catenative dol languages
1983
·
A. Ehrenfeucht
, G. Rozenberg
·
Information Processing Letters
·
17
A Short Note on Short Pants
2013
·
Hugo Parlier
·
Canadian Mathematical Bulletin
·
15
PDF
On graphs without cycles of length 0 modulo 4
2025
·
Ervin Győri
, Binlong Li
, et al.
·
Journal of Combinatorial Theory Series B
·
13
PDF
An almost quadratic bound on vertex Folkman numbers
2009
·
Andrzej Dudek
, Vojtěch Rödl
·
Journal of Combinatorial Theory Series B
·
13
PDF
Response time analysis of digraph real-time tasks scheduled with static priority: generalization, approximation, and improvement
2017
·
Chao Peng
, Haibo Zeng
·
Real-Time Systems
·
12
The Size of 3-Cross-Free Families
2001
·
Tamás Fleiner
·
COMBINATORICA
·
11
PDF
The size-Ramsey number of 3-uniform tight paths
2021
·
Jie Han
, Yoshiharu Kohayakawa
, et al.
·
Advances in Combinatorics
·
10
PDF
Linear Upper Bound on the Ribbonlength of Torus Knots and Twist Knots
2018
·
Tian, Grace
·
arXiv (Cornell University)
·
10
PDF
Polynomial Formal Verification of KFDD Circuits
2023
·
Martha Schnieber
, Rolf Drechsler
·
ACM/IEEE International Conference on Formal Methods and Models for Co-Design (MEMOCODE)
·
9
PDF
Regularity of symbolic powers of square-free monomial ideals
2023
·
Thi Hien Truong
, Nam Trung Tran
·
Arkiv för matematik
·
9
PDF
Novel Hybrid Scheduling Technique for Sensor Nodes with Mixed Criticality Tasks
2017
·
Mihai-Victor Micea
, Cristina-Sorina Stangaciu
, et al.
·
Sensors
·
9
PDF
Show more works
View as search
Works count:
102
Citation count:
1,583
Year
Topic
Type