The following pages link to Ken Steiglitz (Q908789):
Displaying 50 items.
- Pairwise competition and the replicator equation (Q253486) (← links)
- A scalable architecture for lattice-gas simulations (Q908790) (← links)
- The complexity of analog computation (Q1077163) (← links)
- Soliton-like behavior in automata (Q1083209) (← links)
- A fast error evaluation algorithm for polynomial approximation (Q1237345) (← links)
- Simulating the madness of crowds: Price bubbles in an auction-mediated robot market (Q1273456) (← links)
- Rational transform approximation via the Laguerre spectrum (Q2550287) (← links)
- Filter-length word-length tradeoffs in FIR digital filter design (Q3039225) (← links)
- Maintaining bipartite matchings in the presence of failures (Q3141219) (← links)
- Optimization of signal sets for partial-response channels. I. Numerical techniques (Q3363226) (← links)
- Bounds on maximum throughput for digital communications with finite-precision and amplitude constraints (Q3483211) (← links)
- A Semiring on Convex Polygons and Zero-Sum Cycle Problems (Q3495676) (← links)
- Eigenvectors and functions of the discrete Fourier transform (Q3677064) (← links)
- Phase unwrapping by factorization (Q3680172) (← links)
- Testability Conditions for Bilateral Arrays of Combinational Cells (Q3695201) (← links)
- Some complexity issues in digital signal processing (Q3700832) (← links)
- (Q3734166) (← links)
- (Q3804163) (← links)
- Planarity testing of doubly periodic infinite graphs (Q3826573) (← links)
- Eigenvalues of symmetric matrices: System theory conditions for distinctness (Q3875768) (← links)
- A Note on the Complexity of the Star-Star Concentrator Problem (Q3912010) (← links)
- Some Complexity Results in the Design of Deadlock-Free Packet Switching Networks (Q3922167) (← links)
- The Complexity of Optimal Addressing in Radio Networks (Q3953691) (← links)
- (Q3980264) (← links)
- Maximizing the output energy of a linear channel with a time- and amplitude-limited input (Q4008335) (← links)
- Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem <i>n / 2 / F / F¯</i> (Q4072835) (← links)
- Evaluating Polynomials at Fixed Sets of Points (Q4091364) (← links)
- A Problem in Single-Machine Sequencing with Nonlinear Delay Costs (Q4114936) (← links)
- An&lt;tex&gt;O(N^2)&lt;/tex&gt;algorithm for partial fraction expansion (Q4115982) (← links)
- (Q4146536) (← links)
- On the Complexity of Local Search for the Traveling Salesman Problem (Q4162482) (← links)
- Some Examples of Difficult Traveling Salesman Problems (Q4162995) (← links)
- Some experiments with the pathological linear programs of N. Zadeh (Q4170524) (← links)
- The Design of Small-Diameter Networks by Local Search (Q4198640) (← links)
- (Q4217266) (← links)
- (Q4320651) (← links)
- (Q4354116) (← links)
- (Q4544347) (← links)
- (Q4739657) (← links)
- Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems (Q4766036) (← links)
- Heuristic-Programming Solution of a Flowshop-Scheduling Problem (Q4767113) (← links)
- A COMPARISON STUDY OF HEURISTICS FOR MAPPING PARALLEL ALGORITHMS TO MESSAGE-PASSING MULTIPROCESSORS (Q4820138) (← links)
- (Q4837657) (← links)
- Discrete-time signal design for maximizing separation in amplitude (Q4840881) (← links)
- (Q4845527) (← links)
- (Q4893447) (← links)
- (Q5501329) (← links)
- Optimal Binary Coding of Ordered Numbers (Q5510068) (← links)
- Transmission of an analog signal over a fixed bit-rate channel (Q5516525) (← links)
- Bases in Hilbert Space Related to the Representation of Stationary Operators (Q5555993) (← links)
