| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q5501329 | 2015-08-03 | Paper |
| A COMPARISON STUDY OF HEURISTICS FOR MAPPING PARALLEL ALGORITHMS TO MESSAGE-PASSING MULTIPROCESSORS | 2004-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4544347 | 2002-08-04 | Paper |
| Simulating the madness of crowds: Price bubbles in an auction-mediated robot market | 1998-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4217266 | 1998-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4354116 | 1997-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4893447 | 1996-10-30 | Paper |
| Discrete-time signal design for maximizing separation in amplitude | 1995-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4845527 | 1995-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4837657 | 1995-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4320651 | 1995-02-02 | Paper |
| Maintaining bipartite matchings in the presence of failures | 1994-08-31 | Paper |
| Maximizing the output energy of a linear channel with a time- and amplitude-limited input | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3980264 | 1992-06-26 | Paper |
| Optimization of signal sets for partial-response channels. I. Numerical techniques | 1991-01-01 | Paper |
| Bounds on maximum throughput for digital communications with finite-precision and amplitude constraints | 1990-01-01 | Paper |
| A Semiring on Convex Polygons and Zero-Sum Cycle Problems | 1990-01-01 | Paper |
| A scalable architecture for lattice-gas simulations | 1989-01-01 | Paper |
| Planarity testing of doubly periodic infinite graphs | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3804163 | 1987-01-01 | Paper |
| The complexity of analog computation | 1986-01-01 | Paper |
| Soliton-like behavior in automata | 1986-01-01 | Paper |
| Testability Conditions for Bilateral Arrays of Combinational Cells | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3734166 | 1985-01-01 | Paper |
| Some complexity issues in digital signal processing | 1984-01-01 | Paper |
| Eigenvectors and functions of the discrete Fourier transform | 1982-01-01 | Paper |
| Phase unwrapping by factorization | 1982-01-01 | Paper |
| The Complexity of Optimal Addressing in Radio Networks | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4739657 | 1982-01-01 | Paper |
| A Note on the Complexity of the Star-Star Concentrator Problem | 1981-01-01 | Paper |
| Some Complexity Results in the Design of Deadlock-Free Packet Switching Networks | 1981-01-01 | Paper |
| Filter-length word-length tradeoffs in FIR digital filter design | 1980-01-01 | Paper |
| Eigenvalues of symmetric matrices: System theory conditions for distinctness | 1980-01-01 | Paper |
| The Design of Small-Diameter Networks by Local Search | 1979-01-01 | Paper |
| Some Examples of Difficult Traveling Salesman Problems | 1978-01-01 | Paper |
| Some experiments with the pathological linear programs of N. Zadeh | 1978-01-01 | Paper |
| A fast error evaluation algorithm for polynomial approximation | 1977-01-01 | Paper |
| An<tex>O(N^2)</tex>algorithm for partial fraction expansion | 1977-01-01 | Paper |
| On the Complexity of Local Search for the Traveling Salesman Problem | 1977-01-01 | Paper |
| A Problem in Single-Machine Sequencing with Nonlinear Delay Costs | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4146536 | 1976-01-01 | Paper |
| Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n / 2 / F / F¯ | 1975-01-01 | Paper |
| Evaluating Polynomials at Fixed Sets of Points | 1975-01-01 | Paper |
| Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems | 1974-01-01 | Paper |
| Heuristic-Programming Solution of a Flowshop-Scheduling Problem | 1974-01-01 | Paper |
| Randomized Pattern Search | 1972-01-01 | Paper |
| The Expression of Algorithms by Charts | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5674402 | 1972-01-01 | Paper |
| The identification and control of unknown linear discrete systems† | 1971-01-01 | Paper |
| A new derivation of Frisch's algorithm for calculating vertex-pair connectivity | 1971-01-01 | Paper |
| On system identification from noise-obscured input and output measurements† | 1970-01-01 | Paper |
| Bases in Hilbert Space Related to the Representation of Stationary Operators | 1968-01-01 | Paper |
| Series expansion of wide-sense stationary random processes | 1968-01-01 | Paper |
| Transmission of an analog signal over a fixed bit-rate channel | 1966-01-01 | Paper |
| Encoding of analog signals for binary symmetric channels | 1966-01-01 | Paper |
| Rational transform approximation via the Laguerre spectrum | 1965-01-01 | Paper |
| Optimal Binary Coding of Ordered Numbers | 1965-01-01 | Paper |
| The equivalence of digital and analog signal processing | 1965-01-01 | Paper |
