Richard E. Ladner

From MaRDI portal
Revision as of 10:52, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:930896

Available identifiers

zbMath Open ladner.richard-eDBLPl/RELadnerWikidataQ29032774 ScholiaQ29032774MaRDI QIDQ930896

List of research outcomes

PublicationDate of PublicationType
Sorting by parallel insertion on a one-dimensional subbus array2018-07-09Paper
Optimizing static calendar queues2018-06-12Paper
Algorithms for dynamic multicast key distribution trees2015-09-04Paper
https://portal.mardi4nfdi.de/entity/Q55018152015-08-14Paper
https://portal.mardi4nfdi.de/entity/Q55012632015-08-03Paper
A general buffer scheme for the windows scheduling problem2014-04-01Paper
Windows scheduling of arbitrary-length jobs on multiple machines2014-02-05Paper
Windows scheduling as a restricted version of bin packing2010-08-14Paper
Algorithms and Data Structures2010-04-20Paper
Scheduling techniques for media-on-demand2009-05-13Paper
Optimal delay for media-on-demand with pre-loading and pre-buffering2008-06-24Paper
Algorithms for dynamic multicast key distribution2008-06-20Paper
Off-line and on-line guaranteed start-up delay for media-on-demand with stream merging2008-01-11Paper
Semi-matchings for bipartite graphs and load balancing2006-10-05Paper
https://portal.mardi4nfdi.de/entity/Q54853422006-08-29Paper
Experimental and Efficient Algorithms2005-11-30Paper
Irredundant intervals2005-08-04Paper
Efficient Algorithms for Optimal Stream Merging for Media-on-Demand2005-02-21Paper
https://portal.mardi4nfdi.de/entity/Q48289652004-11-29Paper
https://portal.mardi4nfdi.de/entity/Q44713732004-07-28Paper
https://portal.mardi4nfdi.de/entity/Q44602682004-05-18Paper
Competitive on-line stream merging algorithms for media-on-demand2004-03-14Paper
Windows Scheduling Problems for Broadcast Systems2003-09-28Paper
https://portal.mardi4nfdi.de/entity/Q44176732003-07-29Paper
https://portal.mardi4nfdi.de/entity/Q27683212002-06-23Paper
Fast nearest neighbor search of entropy-constrained vector quantization2001-06-11Paper
Multiresolution banded refinement to accelerate surface reconstruction from polygons2000-02-17Paper
The Influence of Caches on the Performance of Sorting2000-01-09Paper
https://portal.mardi4nfdi.de/entity/Q42523401999-06-17Paper
Counting protocols for reliable end-to-end transmission1999-06-13Paper
Recoverable sequence transmission protocols1998-01-28Paper
https://portal.mardi4nfdi.de/entity/Q48860941996-10-21Paper
Complexity of Sub-Bus Mesh Computations1996-07-23Paper
Interactive proof systems with polynomially bounded strategies1996-04-16Paper
The complexity of computing symmetric functions using threshold circuits1992-09-27Paper
Safety and liveness of \(\omega\)-context-free languages1991-01-01Paper
Polynomial Space Counting Problems1989-01-01Paper
Probabilistic game automata1988-01-01Paper
Estimating the multiplicities of conflicts to speed their resolution in multiple access channels1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47207891986-01-01Paper
Solitaire automata1985-01-01Paper
Signsolvability revisited1984-01-01Paper
Alternating Pushdown and Stack Automata1984-01-01Paper
Alternation bounded auxiliary pushdown automata1984-01-01Paper
Binary Search in a Multiprocessing Environment1983-01-01Paper
Efficient parallel algorithms for linear recurrence computation1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33277261981-01-01Paper
Testing the universal instance assumption1980-01-01Paper
The complexity of problems in systems of communicating sequential processes1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38874431980-01-01Paper
Parallel Prefix Computation1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39040521980-01-01Paper
Propositional dynamic logic of regular programs1979-01-01Paper
The Computational Complexity of Provability in Systems of Modal Propositional Logic1977-01-01Paper
Application of model theoretic games to discrete linear orders and finite automata1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41973391977-01-01Paper
Relativization of questions about log space computability1976-01-01Paper
Space bounds for processing contentless inputs1975-01-01Paper
A comparison of polynomial time reducibilities1975-01-01Paper
On the Structure of Polynomial Time Reducibility1975-01-01Paper
The weak truth table degrees of recursively enumerable sets1975-01-01Paper
A Completely Mitotic Nonrecursive R.E. Degree1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41624801974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40619611973-01-01Paper
Mitotic recursively enumerable sets1973-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: Richard E. Ladner