Introduction

@article{Rajsbaum2007Introduction,
  title={Introduction},
  author={S. Rajsbaum},
  journal={SIGACT News},
  year={2007},
  volume={36},
  pages={36-46}
}
The Distributed Computing Column covers the theory of systems that are composed of a number of interacting computing elements. These include problems of communication and networking, databases, distributed shared memory, multiprocessor architectures, operating systems, verification, Internet, and the Web. This issue consists of: "Delayed Password Disclosure," by Markus Jakobsson and Steven Myers. Many thanks to them for their contribution to this issue. 
Urban Archives: endless possibilities
• Users may download and print one copy of any publication from Discovery Research Portal for the purpose of private study or research. • You may not further distribute the material or use it for anyExpand
System-of-system approaches and challenges for multi-site manufacturing
TLDR
An overview of distributed manufacturing, dispersed network manufacturing, virtual enterprises and cloud manufacturing/manufacturing-as-a-service terms and paradigms and their characteristics, overlaps and differences is provided. Expand
Correspondence
A Letter to the Editor must be signed by all authors, typewritten, and double spaced (including references), and must not exceed one and one-half typed pages in length. To be considered forExpand
Data Privacy and Academic Libraries: Non-PII, PII, and Librarians’ Reflections (Part 1)
TLDR
While non-PII data can inform decision-making in libraries, it has been found this type of data to be limited in the ways outlined in this editorial. Expand
Selecting link resolver and knowledge base software: Implications of interoperability
TLDR
This paper investigates link resolver products to increase efficiency of back-end workflows while maintaining or improving the patron experience and the methodology used for product comparison may be useful for other libraries. Expand
Computation and cognition
  • C. Wallis
  • Computer Science
  • J. Exp. Theor. Artif. Intell.
  • 2003
TLDR
This paper looks at three theories regarding the exact nature of cognitive state transitions and argues that properly understood, all the types of arguments in the literature support dynamic computationalism. Expand
Domain Knowledge for Genetic
This paper describes the encoding of domain knowledge for use by a genetic algorithm. We use the domain of system connguration design problems; speciically, the structural design and optimization ofExpand
Is the Internet an Emergent Public Sphere?
Much has been made of the power of the Internet and related communication technologies to serve as a new public sphere in which democracy can flourish. The evidence, however, has been limited; likeExpand
Descriptive Metadata for Scientific Data Repositories: A Comparison of Information Scientist and Scientist Organizing Behaviors
TLDR
This study used a concurrent triangulation mixed-methods approach to gather basic quantitative and qualitative data about how 11 information professionals and 16 scientists organized data sets for personal and repository use. Expand
Serials, FRBR, and Library Linked Data: A Way Forward
This article proposes a new way of cataloging serials using linked data and Resource Description Framework (RDF), as well as how the concepts of Functional Requirements for Bibliographic RecordsExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 67 REFERENCES
Communicating sequential processes
This paper suggests that input and output are basic primitives of programming and that parallel composition of communicating sequential processes is a fundamental program structuring method. WhenExpand
The knowledge complexity of interactive proof-systems
Permission to copy without fee all or part of this material is granted provided that the copies arc not made or distributed for direct commercial advantage. rhe ACM copyright notice and the title ofExpand
Distributed computing in practice: the Condor experience
TLDR
The history and philosophy of the Condor project is provided and how it has interacted with other projects and evolved along with the field of distributed computing is described. Expand
Association rule mining in peer-to-peer systems
TLDR
This work presents an algorithm by which every node in the system can reach the exact solution, as if it were given the combined database, and is entirely asynchronous, imposes very little communication overhead, transparently tolerates network topology changes and node failures, and quickly adjusts to changes in the data as they occur. Expand
Locality in Distributed Graph Algorithms
  • N. Linial
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1992
TLDR
This model focuses on the issue of locality in distributed processing, namely, to what extent a global solution to a computational problem can be obtained from locally available data. Expand
Fault-Local Distributed Mending
TLDR
This abstract introduces the concept of fault-local algorithms, which are algorithms whose cost depends only on the (unknown) number of faults, and demonstrates the feasibility of fault locality via developing such algorithms for a number of key problems, including MIS and D+1 coloring. Expand
Gryphon: An Information Flow Based Approach to Message Brokering
TLDR
This extended abstract outlines the major problems in message brokering and Gryphon's approach to solving them. Expand
A simple parallel algorithm for the maximal independent set problem
  • M. Luby
  • Computer Science
  • STOC '85
  • 1985
TLDR
Powerful and general techniques for converting Monte Carlo algorithms into deterministic algorithms are used to convert the Monte Carlo algorithm for the MIS problem into a simple deterministic algorithm with the same parallel running time. Expand
On the locality of bounded growth
TLDR
It is shown that on the widely used unit disk graph, covering and packing linear programs can be approximated by constant factors in constant time and results in asymptotically optimal O(log*!n) time algorithms for many important problems. Expand
Efficient Dynamic Aggregation
TLDR
An instance-based lower bound on the efficiency of dynamic aggregation algorithms is presented, and two algorithms matching this bound are provided, one of which more closely monitors the aggregate value by sampling it more frequently, at the cost of slightly higher message complexity. Expand
...
1
2
3
4
5
...