Charles U. Martel

Available identifiers

zbMath Open martel.charles-uMaRDI QIDQ1062625

List of research outcomes

Publication	Date of Publication	Type
Optimal prioritized conflict resolution on a multiple access channel	2018-09-14	Paper
Optimal circuits for parallel multipliers	2018-07-09	Paper
Stochastic shortest path with unlimited hops	2010-06-16	Paper
https://portal.mardi4nfdi.de/entity/Q3024791	2005-07-04	Paper
A general model for authenticated data structures	2004-09-22	Paper
Dynamic prioritized conflict resolution on multiple access broadcast networks	2003-11-10	Paper
The expected complexity of Prim's minimum spanning tree algorithm	2002-07-14	Paper
The structure and complexity of sports elimination numbers	2002-02-28	Paper
https://portal.mardi4nfdi.de/entity/Q2765457	2002-01-24	Paper
https://portal.mardi4nfdi.de/entity/Q4525732	2001-01-24	Paper
A Fast Algorithm for Optimally Increasing the Edge Connectivity	1998-02-10	Paper
Analyzing self-adjusting linear list algorithms with deletions and unsuccessful searches	1997-02-27	Paper
https://portal.mardi4nfdi.de/entity/Q4763410	1995-04-11	Paper
Asynchronous PRAMs with memory latency	1995-03-08	Paper
On the Complexity of Certified Write-All Algorithms	1994-05-05	Paper
Unsuccessful Search in Self-Adjusting Data Structures	1994-03-27	Paper
Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers	1993-03-09	Paper
A fast algorithm for the generalized parametric minimum cut problem and applications	1992-06-28	Paper
Self-adjusting multi-way search trees	1992-06-26	Paper
On the efficiency of maximum-flow algorithms on networks with small integer capacities	1989-01-01	Paper
Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs	1989-01-01	Paper
A comparison of phase and nonphase network flow algorithms	1989-01-01	Paper
Fast Algorithms for Bipartite Network Flow	1987-01-01	Paper
Polymatroidal flows with lower bounds	1986-01-01	Paper
Lower bounds on parallel algorithms for finding the first maximal independent set	1986-01-01	Paper
A linear time bin-packing algorithm	1985-01-01	Paper
Preemptive Scheduling to Minimize Maximum Completion Time on Uniform Processors with Memory Constraints	1985-01-01	Paper
A Generalized Uniform Processor System	1985-01-01	Paper
Preemptive Scheduling with Release Times, Deadlines, and Due Times	1982-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3962462	1982-01-01	Paper
Computing Maximal “Polymatroidal” Network Flows	1982-01-01	Paper
Flow Network Formulations of Polymatroid Optimization Problems	1982-01-01	Paper
Scheduling periodically occurring tasks on multiple processors	1981-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3885187	1980-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: Charles U. Martel