article

Free access

Message from the Editor

Author:

Robert M. CorlessAuthors Info & Claims

ACM SIGSAM Bulletin, Volume 30, Issue 1

Page 2

https://doi.org/10.1145/231191.570104

Published: 01 March 1996 Publication History

PDF eReader

Abstract

No abstract available.

Cited By

View all

Beaumont JBradford RDavenport JPhisanbut NGao XLabahn G(2005)Adherence is better than adjacencyProceedings of the 2005 international symposium on Symbolic and algebraic computation10.1145/1073884.1073892(37-44)Online publication date: 24-Jul-2005
https://dl.acm.org/doi/10.1145/1073884.1073892
Beaumont JBradford RDavenport JPhisanbut NSchicho J(2004)A poly-algorithmic approach to simplifying elementary functionsProceedings of the 2004 international symposium on Symbolic and algebraic computation10.1145/1005285.1005292(27-34)Online publication date: 4-Jul-2004
https://dl.acm.org/doi/10.1145/1005285.1005292
Davenport J(2003)MKM from Book to ComputerProceedings of the Second International Conference on Mathematical Knowledge Management10.5555/648071.748515(17-29)Online publication date: 16-Feb-2003
https://dl.acm.org/doi/10.5555/648071.748515
Show More Cited By

Recommendations

Logically Instantaneous Message Passing in Asynchronous Distributed Systems

Asynchrony (due to unknown message transmission delay) complicates the design of protocols for distributed systems. To simplify the protocol design task therefore, the authors propose an interprocess (point-to-point) communication mechanism that has the ...
A Message Franking Channel
Information Security and Cryptology
Abstract
We pursue to formalize and instantiate a secure bidirectional channel with message franking properties. Under this model a sender may send an abusive message to the receiver and the latter wish to open it in a verifiable way to a third party. ...
Process cooperation in multiple message broadcast
PVM/MPI'07: Proceedings of the 14th European conference on Recent Advances in Parallel Virtual Machine and Message Passing Interface

We present a process cooperation algorithm for broadcasting m messages among n processes, m ≥ 1, n ≥ 1, in one-port fully-connected communication systems. In this algorithm, the n processes are organized into 2^{⌊log n⌋} one- or two-process units. Messages ...

Comments

Information & Contributors

Information

Published In

ACM SIGSAM Bulletin Volume 30, Issue 1

March 1996

58 pages

ISSN:0163-5824

DOI:10.1145/231191

Editor:
Robert M. Corless
Univ. of Western Ontario, London, Ont., Canada

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 1996

Published in SIGSAM Volume 30, Issue 1

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
77
Total Downloads

Downloads (Last 12 months)9
Downloads (Last 6 weeks)1

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Beaumont JBradford RDavenport JPhisanbut NGao XLabahn G(2005)Adherence is better than adjacencyProceedings of the 2005 international symposium on Symbolic and algebraic computation10.1145/1073884.1073892(37-44)Online publication date: 24-Jul-2005
https://dl.acm.org/doi/10.1145/1073884.1073892
Beaumont JBradford RDavenport JPhisanbut NSchicho J(2004)A poly-algorithmic approach to simplifying elementary functionsProceedings of the 2004 international symposium on Symbolic and algebraic computation10.1145/1005285.1005292(27-34)Online publication date: 4-Jul-2004
https://dl.acm.org/doi/10.1145/1005285.1005292
Davenport J(2003)MKM from Book to ComputerProceedings of the Second International Conference on Mathematical Knowledge Management10.5555/648071.748515(17-29)Online publication date: 16-Feb-2003
https://dl.acm.org/doi/10.5555/648071.748515
Davenport J(2003)The Geometry of ℂ n is Important for the Algebra of Elementary FunctionsAlgebra, Geometry and Software Systems10.1007/978-3-662-05148-1_11(207-224)Online publication date: 2003
https://doi.org/10.1007/978-3-662-05148-1_11
Davenport J(2003)MKM from Book to Computer: A Case StudyMathematical Knowledge Management10.1007/3-540-36469-2_2(17-29)Online publication date: 30-Jan-2003
https://doi.org/10.1007/3-540-36469-2_2
Corless RJeffrey D(2002)The Wright omega FunctionProceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation10.5555/648168.750650(76-89)Online publication date: 1-Jul-2002
https://dl.acm.org/doi/10.5555/648168.750650
Corless RJeffrey DKnuth DChar BWang P(1997)A sequence of series for the Lambert W functionProceedings of the 1997 international symposium on Symbolic and algebraic computation10.1145/258726.258783(197-204)Online publication date: 1-Jul-1997
https://dl.acm.org/doi/10.1145/258726.258783

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Recommendations

Logically Instantaneous Message Passing in Asynchronous Distributed Systems

A Message Franking Channel

Process cooperation in multiple message broadcast

Comments

Information

Published In

Publisher

Publication History

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations