Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Algorithms, Concurrency and Knowledge

1995 Asian Computing Science Conference, ACSC '95 Pathumthani, Thailand, December 11 - 13, 1995. Proceedings

  • Conference proceedings
  • © 1995

Overview

Editors:
  1. Kanchana Kanchanasut
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Jean-Jacques Lévy
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1023)

Included in the following conference series:

Conference proceedings info: ACSC 1995.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (29 papers)

  1. Front Matter

    Download chapter PDF

  2. Leapfrogging samplesort

    • Eliezer A. Albacea
    Pages 1-9

  3. Spanning 2-trees

    • Leizhen Cai
    Pages 10-22

  4. Minimal linear invariants

    • Ming-Yang Kao
    Pages 23-33

  5. Parallel maximal matching on minimal vertex series parallel digraphs

    • Luca Baffi, Rossella Petreschi
    Pages 34-47

  6. Efficient equality-testing and updating of sets

    • Tak Wah Lam, Ka Hing Lee
    Pages 48-58

  7. Binary space partitions for sets of hyperrectangles

    • Viet Hai Nguyen, Peter Widmayer
    Pages 59-72

  8. Transformation of orthogonal term rewriting systems

    • Sugwoo Byun, Richard Kennaway, Ronan Sleep
    Pages 73-87

  9. An automaton-driven frame disposal algorithm and its proof of correctness

    • M. Satpathy, A. Sanyal, G. Venkatesh
    Pages 88-102

  10. Labeled λ-calculus and a generalised notion of strictness

    • Milind Gandhe, G. Venkatesh, Amitabha Sanyal
    Pages 103-110

  11. Preemption primitives in reactive languages

    • Sophie Pinchinat, Éric Rutten, R. K. Shyamasundar
    Pages 111-125

  12. Multi-action process algebra

    • Wojciech Fraczak
    Pages 126-140

  13. Complexity as a basis for comparing semantic models of concurrency

    • Alan Mycroft, Pierpaolo Degano, Corrado Priami
    Pages 141-155

  14. Combinatory formulations of concurrent languages

    • N. Raja, R. K. Shyamasundar
    Pages 156-170

  15. Constraints for free in concurrent computation

    • Joachim Niehren, Martin Müller
    Pages 171-186

  16. Formalizing inductive proofs of message recovery in distributed systems

    • Pankaj Jalote
    Pages 187-194

  17. Detecting distributed termination in the presence of node failure

    • Xinfeng Ye, John Keane
    Pages 195-209

  18. An extended gradient model for NUMA multiprocessor systems

    • Feixiong Liu, Thomas Peikenkamp, Werner Damm
    Pages 210-224

  19. Efficient parallel permutation-based range-join algorithms on mesh-connected computers

    • Shao Dong Chen, Hong Shen, Rodney Topor
    Pages 225-238

  20. Pipelined band join in shared-nothing systems

    • Hongjun Lu, Kian-Lee Tan
    Pages 239-253
Back to top

Keywords

About this book

This volume constitutes the refereed proceedings of the 1995 Asian Computing Science Conference, ACSC 95, held in Pathumthani, Thailand in December 1995.
The 29 fully revised papers presented were selected from a total of 102 submissions; clearly the majority of the participating researchers come from South-East Asian countries, but there is also a strong international component. The volume reflects research activities, particularly by Asian computer science researchers, in different areas. Special attention is paid to algorithms, knowledge representation, programming and specification languages, verification, concurrency, networking and distributed systems, and databases.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation