Author image not provided
 Kenneth Steiglitz

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article37.24
Citation Count1,564
Publication count42
Publication years1972-2012
Available for download10
Average downloads per article544.60
Downloads (cumulative)5,446
Downloads (12 Months)146
Downloads (6 Weeks)26
ACM Fellow
SEARCH
ROLE
Arrow RightAuthor only
· Advisor only
· All roles


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


42 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 42
Result page: 1 2 3

Sort by:

1 published by ACM
October 2012 Journal on Computing and Cultural Heritage (JOCCH): Volume 5 Issue 3, October 2012
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 2,   Downloads (12 Months): 24,   Downloads (Overall): 289

Full text available: PDFPDF
In this article, we analyze the fracture patterns observed in wall paintings excavated at Akrotiri, a Bronze Age Aegean settlement destroyed by a volcano on the Greek island of Thera around 1630 BC. We use interactive programs to trace detailed fragment boundaries in images of manually reconstructed wall paintings. Then, ...
Keywords: Statistical modeling, hierarchical fracture, cultural heritage

2
September 2010 VAST'10: Proceedings of the 11th International conference on Virtual Reality, Archaeology and Cultural Heritage
Publisher: Eurographics Association
Bibliometrics:
Citation Count: 4

In this paper, we analyze the fracture patterns observed in wall paintings excavated from Akrotiri, a Bronze Age Aegean city destroyed by earthquakes preceding a volcanic eruption on Thera (modern Santorini) around 1630 BC. We use interactive programs to trace detailed fragment boundaries in images of manually reconstructed wall paintings. ...

3
March 2007
Bibliometrics:
Citation Count: 5


4
January 2004 SODA '04: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Publisher: Society for Industrial and Applied Mathematics
Bibliometrics:
Citation Count: 55
Downloads (6 Weeks): 1,   Downloads (12 Months): 18,   Downloads (Overall): 364

Full text available: PDFPDF
We consider the problem of picking (buying) an inexpensive s -- t path in a graph where edges are owned by independent (selfish) agents, and the cost of an edge is known to its owner only. We study the problem of finding frugal mechanisms for this task, i.e. we investigate ...

5
January 2001 Collision-based computing
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 4


6
December 2000 WSC '00: Proceedings of the 32nd conference on Winter simulation
Publisher: Society for Computer Simulation International
Bibliometrics:
Citation Count: 14
Downloads (6 Weeks): 0,   Downloads (12 Months): 9,   Downloads (Overall): 364

Full text available: PDFPDF
The need to understand dynamic behavior in auctions is increasing with the popularization of online auctions. Applications include designing auction mechanisms, bidding strategies, and server systems. We describe simulations of a typical online auction, where the duration is fixed, and the second-highest price is continuously posted and determines the winner's ...

7
March 2000 Proceedings from the international conference on complex systems on Unifying themes in complex systems
Publisher: Perseus Books
Bibliometrics:
Citation Count: 0


8
August 1998 Computational Economics: Volume 12 Issue 1, August 1998
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 5

We simulate a multiagent market with production, consumption, and exchange mediated by a sealed-bid double auction. Marked price bubbles and subsequent crashes occur when value-based (fundamentals-driven) and trend-based traders are both present, and the market equilibrium price is ramped up exogenously. Similarly, negative price bubbles and recoveries occur when the ...
Keywords: auction-mediated robot market., negative price bubbles, price bubbles

9

10
April 1996 Market-based control: a paradigm for distributed resource allocation
Publisher: World Scientific Publishing Co., Inc.
Bibliometrics:
Citation Count: 8


11
December 1995 IEEE/ACM Transactions on Networking (TON): Volume 3 Issue 6, Dec. 1995
Publisher: IEEE Press
Bibliometrics:
Citation Count: 50
Downloads (6 Weeks): 1,   Downloads (12 Months): 10,   Downloads (Overall): 380

Full text available: PDFPDF

12
July 1995 ASAP '95: Proceedings of the IEEE International Conference on Application Specific Array Processors
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 1

We describe an approach to parallel computation using particle propagation and collisions in a one-dimensional cellular automaton using a particle model -- a Particle Machine (PM). Such a machine has the parallelism, structural regularity, and local connectivity of systolic arrays, but is general and programmable. It contains no explicit multipliers, ...
Keywords: particle machine, particle model, cellular automaton, parallel arithmetic

13
April 1995 INFOCOM '95: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 9

Usage-based pricing of offered traffic to a data network can be an effective technique for congestion control. To gain insight into the benefits usage-based pricing offers, the authors propose and study a simple model in which many users wish to transmit packets to a single-server queue. Based on the announced ...
Keywords: delay, economics, heterogeneous user population, packet data, random user population, tariffs, usage-based pricing, fixed-point equation, quality of service, revenue, single-server queue, telecommunication congestion control, telecommunication traffic, data network, packet switching, queueing theory, server capacity, congestion control, data communication, service capacity

14
December 1994 Journal of Parallel and Distributed Computing: Volume 23 Issue 3, Dec. 1994
Publisher: Academic Press, Inc.
Bibliometrics:
Citation Count: 0

This paper considers the question of whether a mesh-connected machine is always better than a multi-pipelined machine for iterative 2-d mesh computations. Optimal throughput is determined as a function of a unified measure of resources (cost). The resulting performance curves for the two architectures show that there is a cost ...

15
January 1994 MASCOTS '94: Proceedings of the Second International Workshop on Modeling, Analysis, and Simulation On Computer and Telecommunication Systems
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 7


16
July 1993 IEEE Transactions on Computers: Volume 42 Issue 7, July 1993
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0

The authors study fault-tolerant redundant structures for maintaining reliable arrays. In particular, they assume that the desired array (application graph) is embedded in a certain class of regular, bounded-degree graphs called dynamic graphs. The degree of reconfigurability (DR) and DR with distance (DR/sup d/) of a redundant graph are defined. ...
Keywords: reliability, reliable arrays, systolic arrays, application graph, systolic arrays., time complexity, bounded-degree graphs, fault tolerant computing, lower bound, reconfigurable architectures, dynamic graphs, fault-tolerant redundant structures, finitely reconfigurable, locally reconfigurable, reconfigurability, wavefront arrays

17
November 1992 Journal of VLSI Signal Processing Systems: Volume 4 Issue 4, Nov. 1992
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 0

This paper describes a methodology based on dependency graphs for doing concurrent run-time error detection in systolic arrays and wavefront processors. It combines the projection method of deriving systolic arrays from dependency graphs with the idea of input-triggered testing. We call the method ITRED, forInput-driven Time-Redundancy Error Detection. Tests are ...

18
November 1992 Journal of VLSI Signal Processing Systems: Volume 4 Issue 4, Nov. 1992
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 0


19
June 1991 Journal of VLSI Signal Processing Systems: Volume 2 Issue 4, May 1991
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 0

A critical problem in building long systolic arrays lies in efficient and reliable synchronization. We address this problem in the context of synchronous systems by introducing probabilistic models for two alternative clock distribution schemes: tree and straight-line clocking. We present analytic bounds for the Probability of Failure and the Mean ...

20
May 1991 Journal of VLSI Signal Processing Systems: Volume 2 Issue 4, May 1991
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 2




The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us