Person:1062625: Difference between revisions

From MaRDI portal
Person:1062625
Created automatically from import230924090903
 
m AuthorDisambiguator moved page Charles U. Martel to Charles U. Martel: Duplicate
 
(No difference)

Latest revision as of 14:51, 9 December 2023

Available identifiers

zbMath Open martel.charles-uMaRDI QIDQ1062625

List of research outcomes

PublicationDate of PublicationType
Optimal prioritized conflict resolution on a multiple access channel2018-09-14Paper
Optimal circuits for parallel multipliers2018-07-09Paper
Stochastic shortest path with unlimited hops2010-06-16Paper
https://portal.mardi4nfdi.de/entity/Q30247912005-07-04Paper
A general model for authenticated data structures2004-09-22Paper
Dynamic prioritized conflict resolution on multiple access broadcast networks2003-11-10Paper
The expected complexity of Prim's minimum spanning tree algorithm2002-07-14Paper
The structure and complexity of sports elimination numbers2002-02-28Paper
https://portal.mardi4nfdi.de/entity/Q27654572002-01-24Paper
https://portal.mardi4nfdi.de/entity/Q45257322001-01-24Paper
A Fast Algorithm for Optimally Increasing the Edge Connectivity1998-02-10Paper
Analyzing self-adjusting linear list algorithms with deletions and unsuccessful searches1997-02-27Paper
https://portal.mardi4nfdi.de/entity/Q47634101995-04-11Paper
Asynchronous PRAMs with memory latency1995-03-08Paper
On the Complexity of Certified Write-All Algorithms1994-05-05Paper
Unsuccessful Search in Self-Adjusting Data Structures1994-03-27Paper
Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers1993-03-09Paper
A fast algorithm for the generalized parametric minimum cut problem and applications1992-06-28Paper
Self-adjusting multi-way search trees1992-06-26Paper
On the efficiency of maximum-flow algorithms on networks with small integer capacities1989-01-01Paper
Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs1989-01-01Paper
A comparison of phase and nonphase network flow algorithms1989-01-01Paper
Fast Algorithms for Bipartite Network Flow1987-01-01Paper
Polymatroidal flows with lower bounds1986-01-01Paper
Lower bounds on parallel algorithms for finding the first maximal independent set1986-01-01Paper
A linear time bin-packing algorithm1985-01-01Paper
Preemptive Scheduling to Minimize Maximum Completion Time on Uniform Processors with Memory Constraints1985-01-01Paper
A Generalized Uniform Processor System1985-01-01Paper
Preemptive Scheduling with Release Times, Deadlines, and Due Times1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39624621982-01-01Paper
Computing Maximal “Polymatroidal” Network Flows1982-01-01Paper
Flow Network Formulations of Polymatroid Optimization Problems1982-01-01Paper
Scheduling periodically occurring tasks on multiple processors1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38851871980-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Charles U. Martel