Name
Papers
Collaborators
KENNETH STEIGLITZ
77
74
Citations 
PageRank 
Referers 
1128
660.13
1979
Referees 
References 
423
282
Search Limit
1001000
Title
Citations
PageRank
Year
Analyzing and simulating fracture patterns of theran wall paintings20.352012
Analyzing Fracture Patterns in TheranWall Paintings00.342010
Isomorphism as technology transfer00.342005
Frugality in path auctions727.232004
Signal Standardization in Collision-based Soliton Computing.10.492004
Agent-based simulation of dynamic online auctions223.812000
Functional Algorithm Simulation of the Fast Multipole Method: Architectural Implications.60.701996
When Can Solitons Compute?20.401996
Implementation of Parallel Arithmetic in a Cellular Automaton30.461995
A Comparison Study of Heuristics for Mapping Parallel Algorithms to Message-Passing Multiprocessors10.351995
Optimization of wireless resources for personal communications mobility tracking11746.861995
Usage-based pricing of packet data generated by a heterogeneous user population112.501995
Discrete-time signal design for maximizing separation in amplitude20.611995
FAST: a functional algorithm simulated testbed121.111994
Programmable Parallel Arithmetic in Cellular Automata Using a Particle Model.70.791994
A comparison of two application-specific architectures for 2-d mesh computations00.341994
A comparison of techniques used for mapping parallel algorithms to message-passing multiprocessors50.621994
Reconfigurability and reliability of systolic/wavefront arrays10.381993
Maintaining bipartite matchings in the presence of failures20.421993
Two-Dimensional FHP Lattice Gases Are Computation Universal.00.341993
Message Ordering In Multiprocessors With Synchronous Communication20.441992
Error detection in arrays via dependency graphs10.411992
Run-time error detection in arrays based on the data-dependency graph00.341992
Suppression of near- and far-end crosstalk by linear pre- and post-filtering5976.391992
METEOR: a constraint-based FIR filter design program369.231992
Explicit construction for reliable reconfigurable array architectures00.341991
Comparison of tree and straight-line clocking for long systolic arrays60.991991
Reconfigurability And Reliability Of Systolic Wave-Front Arrays00.341991
Testing parallel simulators for two-dimensional lattice-gas automata10.411991
Optimization of signal sets for partial-response channels. I. Numerical techniques81.581991
Comparison of tree and straight-line clocking for long systolic arrays.00.341991
A practical runtime test method for parallel lattice-gas automata00.341990
Bubbles can make self-timed pipelines fast373.941990
Multichannel signal processing for data communications in the presence of crosstalk3516.181990
Bounds on maximum throughput for digital communications with finite-precision and amplitude constraints42.471990
A semiring on convex polygons and zero-sum cycle problems144.661990
A filter compiler for digital sound synthesis00.341990
An Upper Bound on Expected Clock Skew in Synchronous Systems91.231990
Embedding Computation in One-Dimensional Automata by Phase Coding Solitons148.291988
Planarity Testing Of Doubly Periodic Infinite-Graphs51.831988
Finite-record filtering for bandlimited signals00.341987
Testing for Cycles in Infinite Graphs with Periodic Structure (Extended Abstract)91.691987
Performance of VLSI Engines for Lattice Computations10.491987
Testability Conditions for Bilateral Arrays of Combinational Cells282.081986
A fast tally structure and applications to signal processing.00.341984
Design of FIR filters with flatness constraints.53.241983
Unifying VLSI Array Designs with Geometric Transformations6112.351983
A VLSI layout for a pipelined Dadda multiplier256.941983
Optimal choice of intermediate latching to maximize throughput in VLSI circuits75.121983
Synthesis of timbral families by warped linear prediction41.051981
  • 1
  • 2