Michael L. Fredman

Available identifiers

zbMath Open fredman.michael-lWikidataQ6830425 ScholiaQ6830425MaRDI QIDQ578910

List of research outcomes

Publication	Date of Publication	Type
Lower bounds for dynamic algorithms	2022-12-09	Paper
https://portal.mardi4nfdi.de/entity/Q5133633	2020-11-10	Paper
Fibonacci heaps and their uses in improved network optimization algorithms	2019-07-19	Paper
Products of finite state machines with full coverage	2019-03-29	Paper
https://portal.mardi4nfdi.de/entity/Q4643832	2018-05-29	Paper
An intuitive and simple bounding argument for Quicksort	2014-04-14	Paper
Generalizing a theorem of Wilber on rotations in binary search trees to encompass unordered binary trees	2012-04-26	Paper
On the Matter of Dynamic Optimality in an Extended Model for Tree Access Operations	2011-08-12	Paper
The number of tests required to search an unordered table	2009-04-28	Paper
Adaptive sorting: an information theoretic perspective	2008-04-03	Paper
On the efficiency of pairing heaps and related data structures	2005-01-25	Paper
https://portal.mardi4nfdi.de/entity/Q4418689	2003-08-11	Paper
https://portal.mardi4nfdi.de/entity/Q4542550	2002-08-01	Paper
Lower bounds for fully dynamic connectivity problems in graphs	1999-07-05	Paper
New techniques for designing qualitatively independent systems	1999-03-07	Paper
Optimal Biweighted Binary Trees and the Complexity of Maintaining Partial Sums	1998-09-21	Paper
Products of finite state machines with full coverage	1997-02-28	Paper
On the Complexity of Dualization of Monotone Disjunctive Normal Forms	1996-12-08	Paper
Weighted Binary Trees for Concurrent Searching	1996-06-27	Paper
Three Stacks	1994-09-08	Paper
Trans-dichotomous algorithms for minimum spanning trees and shortest paths	1994-06-29	Paper
Surpassing the information theoretic bound with fusion trees	1994-03-24	Paper
A Note on Finding a Strict Saddlepoint	1992-06-27	Paper
https://portal.mardi4nfdi.de/entity/Q4728783	1989-01-01	Paper
Refined complexity analysis for heap operations	1987-01-01	Paper
Algorithms for computing evolutionary similarity measures with length independent gap penalties	1984-01-01	Paper
On the Size of Separating Systems and Families of Perfect Hash Functions	1984-01-01	Paper
Hash functions for priority queues	1984-01-01	Paper
Storing a Sparse Table with 0 (1) Worst Case Access Time	1984-01-01	Paper
The Complexity of Maintaining an Array and Computing Its Partial Sums	1982-01-01	Paper
The complexity of partial match retrieval in a dynamic setting	1982-01-01	Paper
Query time versus redundancy trade-offs for range queries	1981-01-01	Paper
Inherent complexity trade-offs for range query problems	1981-01-01	Paper
Lower Bounds on the Complexity of Some Optimal Data Structures	1981-01-01	Paper
Observations concerning the complexity of a class of on-line algebraic problems	1981-01-01	Paper
The spanning bound as a measure of range query complexity	1981-01-01	Paper
A Lower Bound on the Complexity of Orthogonal Range Queries	1981-01-01	Paper
On the complexity of computing the measure of ∪[a i ,b i ]	1978-01-01	Paper
How good is the information theory bound in sorting?	1976-01-01	Paper
New Bounds on the Complexity of the Shortest Path Problem	1976-01-01	Paper
A symmetric relationship for a class of partitions	1975-01-01	Paper
On computing the length of longest increasing subsequences	1975-01-01	Paper
Some Arithmetical Packing Problems	1975-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4172927	1975-01-01	Paper
Recurrence relations based on minimization	1974-01-01	Paper
The Distribution of Absolutely Irreducible Polynomials in Several Indeterminates	1972-01-01	Paper
Congruence formulas obtained by counting irreducibles	1971-01-01	Paper
Arithmetical convolution products and generalizations	1970-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Michael L. Fredman