| Publication | Date of Publication | Type |
|---|
| Weight biased leftist trees and modified skip lists | 2024-01-29 | Paper |
| Fair edge deletion problems | 2018-09-14 | Paper |
| Efficient Construction of Pipelined Multibit-Trie Router-Tables | 2018-06-12 | Paper |
| Approximation Algorithms for Sensor Deployment | 2018-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643826 | 2018-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643830 | 2018-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643833 | 2018-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643855 | 2018-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643875 | 2018-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4635994 | 2018-04-23 | Paper |
| Offline first-fit decreasing height scheduling of power loads | 2018-04-04 | Paper |
| Packet Classification Using Space-Efficient Pipelined Multibit Tries | 2017-11-10 | Paper |
| Efficient 2D Multibit Tries for Packet Classification | 2017-08-08 | Paper |
| Recursively Partitioned Static IP Router Tables | 2017-07-27 | Paper |
| GPU-to-GPU and Host-to-Host Multipattern String Matching on a GPU | 2017-07-12 | Paper |
| Consistent Updates for Packet Classifiers | 2017-07-12 | Paper |
| PETCAM—A Power Efficient TCAM Architecture for Forwarding Tables | 2017-07-12 | Paper |
| PC-DUOS+: A TCAM Architecture for Packet Classifiers | 2017-06-20 | Paper |
| PC-TRIO: A Power Efficient TCAM Architecture for Packet Classifiers | 2017-05-16 | Paper |
| Pubsub: An Efficient Publish/Subscribe System | 2017-05-16 | Paper |
| A NEW WEIGHT BALANCED BINARY SEARCH TREE | 2015-04-29 | Paper |
| VERTEX SPLITTING IN DAGS AND APPLICATIONS TO PARTIAL SCAN DESIGNS AND LOSSY CIRCUITS | 2015-04-29 | Paper |
| MERGEABLE DOUBLE-ENDED PRIORITY QUEUES | 2015-04-29 | Paper |
| Computing Hough transforms on hypercube multicomputers | 2011-07-02 | Paper |
| Network Centered Multiple Resource Scheduling in e-Science Applications | 2010-06-15 | Paper |
| Maximum Lifetime Broadcasting in Wireless Networks | 2007-01-09 | Paper |
| Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching | 2005-10-19 | Paper |
| Supernode Binary Search Trees | 2005-10-19 | Paper |
| PARTITIONING 3D PHANTOMS INTO HOMOGENEOUS CUBOIDS | 2005-10-19 | Paper |
| Power balance and apportionment algorithms for the United States Congress | 2005-08-04 | Paper |
| Correspondence-based data structures for double-ended priority queues | 2005-08-04 | Paper |
| A blocked all-pairs shortest-paths algorithm | 2005-08-04 | Paper |
| GATE RESIZING TO REDUCE POWER CONSUMPTION | 2005-06-22 | Paper |
| EFFICIENT DYNAMIC LOOKUP FOR BURSTY ACCESS PATTERNS | 2005-06-22 | Paper |
| HISTOGRAMMING ON A RECONFIGURABLE MESH COMPUTER∗ | 2004-10-06 | Paper |
| SORTING AND SELECTION ON DISTRIBUTED MEMORY BUS COMPUTERS | 2004-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808616 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2743971 | 2001-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2722000 | 2001-07-11 | Paper |
| Sorting \(n\) numbers on \(n\times n\) reconfigurable meshes with buses | 2000-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4223874 | 1999-01-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4398794 | 1998-07-26 | Paper |
| The master-slave paradigm in parallel computer and industrial settings | 1997-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4893470 | 1996-10-30 | Paper |
| Reconfigurable meshes and image processing | 1996-02-26 | Paper |
| Network upgrading problems | 1996-01-16 | Paper |
| Scheduling master-slave multiprocessor systems | 1996-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858940 | 1995-12-20 | Paper |
| Reconfigurable mesh algorithms for the Hough transform | 1995-11-28 | Paper |
| Dual criteria preemptive open-shop problems with minimum makespan | 1995-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4302402 | 1994-08-09 | Paper |
| Deleting vertices to bound path length | 1994-01-01 | Paper |
| Optimal Preemptive Scheduling of Two Unrelated Processors | 1993-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4023843 | 1993-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3999600 | 1992-09-17 | Paper |
| A new VLSI system for adaptive recursive filtering | 1989-01-01 | Paper |
| VLSI architecture for back substitution | 1989-01-01 | Paper |
| Via assignment in single-row routing | 1989-01-01 | Paper |
| A linear algorithm to find a rectangular dual of a planar triangulated graph | 1988-01-01 | Paper |
| Models and algorithms for structured layout | 1988-01-01 | Paper |
| Time and space efficient net extractor | 1988-01-01 | Paper |
| Maximum alignment of interchangeable terminals | 1988-01-01 | Paper |
| VLSI systems for band matrix multiplication | 1987-01-01 | Paper |
| Systolic algorithms for rectilinear polygons | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3780902 | 1987-01-01 | Paper |
| A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3026916 | 1986-01-01 | Paper |
| Single bend wiring | 1986-01-01 | Paper |
| Scheduling Multipipeline and Multiprocessor Computers | 1984-01-01 | Paper |
| Preemptive Scheduling of a Multiprocessor System with Memories to Minimize Maximum Lateness | 1984-01-01 | Paper |
| The complexity of single row routing | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3694701 | 1984-01-01 | Paper |
| Anomalies in parallel branch-and-bound algorithms | 1984-01-01 | Paper |
| Parallel Generation of Postfix and Tree Forms | 1983-01-01 | Paper |
| Nearly on-line scheduling of multiprocessor systems with memories | 1983-01-01 | Paper |
| Binary Trees and Parallel Scheduling Algorithms | 1983-01-01 | Paper |
| Single Row Routing | 1983-01-01 | Paper |
| Parallel Scheduling Algorithms | 1983-01-01 | Paper |
| Parallel permutation and sorting algorithms and a new generalized connection network | 1982-01-01 | Paper |
| Parallel Algorithms to Set Up the Benes Permutation Network | 1982-01-01 | Paper |
| Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops | 1981-01-01 | Paper |
| A Self-Routing Benes Network and Parallel Permutation Algorithms | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3919054 | 1981-01-01 | Paper |
| Parallel Matrix and Graph Algorithms | 1981-01-01 | Paper |
| An optimal routing algorithm for mesh-connected Parallel computers | 1980-01-01 | Paper |
| Bounds for List Schedules on Uniform Processors | 1980-01-01 | Paper |
| On the Computational Complexity of Program Scheme Equivalence | 1980-01-01 | Paper |
| Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer | 1980-01-01 | Paper |
| Scheduling Independent Tasks with Due Times on a Uniform Processor System | 1980-01-01 | Paper |
| Nearly on Line Scheduling of a Uniform Processor System with Release Times | 1979-01-01 | Paper |
| Preemptive Scheduling with Due Dates | 1979-01-01 | Paper |
| Complexity of Scheduling Shops with No Wait in Process | 1979-01-01 | Paper |
| Bitonic Sort on a Mesh-Connected Parallel Computer | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3885184 | 1978-01-01 | Paper |
| Preemptive Scheduling of Uniform Processor Systems | 1978-01-01 | Paper |
| Flowshop and Jobshop Schedules: Complexity and Approximation | 1978-01-01 | Paper |
| Combinatorial Problems: Reductibility and Approximation | 1978-01-01 | Paper |
| Combinatorial Problems: Reductibility and Approximation | 1978-01-01 | Paper |
| An efficient approximate algorithm for the Kolmogorov—Smirnov and Lilliefors tests† | 1978-01-01 | Paper |
| Bounds for LPT Schedules on Uniform Processors | 1977-01-01 | Paper |
| An Efficient Algorithm for the Kolmogorov-Smirnov and Lilliefors Tests | 1977-01-01 | Paper |
| Finite automata with multiplication | 1976-01-01 | Paper |
| Algorithms for Scheduling Independent Tasks | 1976-01-01 | Paper |
| Exact and Approximate Algorithms for Scheduling Nonidentical Processors | 1976-01-01 | Paper |
| Open Shop Scheduling to Minimize Finish Time | 1976-01-01 | Paper |
| P-Complete Approximation Problems | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4195901 | 1976-01-01 | Paper |
| Hierarchies of Turing machines with restricted tape alphabet size | 1975-01-01 | Paper |
| On Computing the Exact Determinant of Matrices with Polynomial Entries | 1975-01-01 | Paper |
| Polynomially Complete Fault Detection Problems | 1975-01-01 | Paper |
| The Computation of Powers of Symbolic Polynomials | 1975-01-01 | Paper |
| Approximate Algorithms for the 0/1 Knapsack Problem | 1975-01-01 | Paper |
| Computationally Related Problems | 1975-01-01 | Paper |
| Computing Partitions with Applications to the Knapsack Problem | 1974-01-01 | Paper |
