Results 231 to 240 of about 60,982 (263)

Upper and Lower Bounds

2003
Upper and lower bounds have already been defined in Definitions 2.1.4 and 2.3.1. From their use in Zorn’s Lemma, as well as their occurrences in the proofs of Dilworth’s Chain-Decomposition Theorem 2.5.7 and Proposition 2.6.7 (in both proofs, sets were defined in terms of their upper bounds), the reader can already infer that bounds of sets play an ...
openaire   +1 more source

Dynamic Perfect Hashing: Upper and Lower Bounds

SIAM Journal on Computing, 1988
Summary: The dynamic dictionary problem is considered: provide an algorithm for storing a dynamic set, allowing the operations insert, delete, and lookup. A dynamic perfect hashing strategy is given: a randomized algorithm for the dynamic dictionary problem that takes \(O(1)\) worst-case time for lookups and \(O(1)\) amortized expected time for ...
Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan   +5 more
openaire   +3 more sources

Lower and upper bounds on graph communicabilities

Information Processing Letters
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amir Hossein Ghodrati, Mohammad Ali Hosseinzadeh   +1 more
openaire   +2 more sources

Upper and lower bounds for the dictionary problem

1988
We give a randomized algorithm for the dictionary problem with O(1) worst case time for lookup and O(1) expected amortized time for insertion and deletion. We also prove an Ω(log n) lower bound on the amortized worst case time complexity of any deterministic algorithm based on hashing. Furthermore, if the worst case lookup time is restricted to k, then
Dietzfelbinger, M., Mehlhorn, K., Meyer auf der Heide, F., Rohnert, H.   +3 more
openaire   +2 more sources

The upper bound and lower bound of the genus of pancake graphs

2009 IEEE Symposium on Computers and Communications, 2009
Both the pancake graph and star graph are Cayley graphs and are especially attractive for parallel processing. They both have sublogarithmic diameter, and are fairly sparse compared to hypercubes. In this paper, we focus on another important property, namely the genus.
Quan T. Nguyen, Saïd Bettayeb
openaire   +1 more source

Correlation lower bounds from correlation upper bounds

Information Processing Letters, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shiteng Chen, Periklis A. Papakonstantinou   +1 more
openaire   +3 more sources

Improved upper and lower bounds fork-broadcasting

Networks, 2001
Summary: We continue the investigation of \(k\)-broadcasting, a variant of broadcasting in which an informed vertex can call up to \(k\) of its neighbors in each time unit. A focus of the investigation into broadcasting is the function \(B_k(n)\), which is the minimum number of edges in any \(n\) vertex graph such that each vertex can originate a \(k\)-
Hovhannes A. Harutyunyan, Arthur L. Liestman   +1 more
openaire   +2 more sources

Upper and Lower Bounds of Eigenvalues

Physical Review, 1950
openaire   +2 more sources

Upper and lower bounds for molecular energies

Journal of Chemical Information and Computer Sciences, 1994
Edgar Eduardo Daza C., José-Luis Villaveces   +1 more
openaire   +1 more source

Recursive lower and dual upper bounds for Bermudan-style options

European Journal of Operational Research, 2020
Alfredo Ibanez, CARLOS Velasco
exaly