Lecture Notes in Computer Science

6th International Symposium, ISAAC '95 Cairns, Australia, December 4 - 6, 1995. Proceedings Proceedings.

By: John Staples (Editor), Peter Eades (Editor), Naoki Katoh (Editor)

Write A Review

Paperback | 15 November 1995

At a Glance

Paperback
464 Pages

Dimensions(cm)
24.13 x 15.88 x 2.54

Paperback

$84.99

or 4 interest-free payments of $21.25 with

Ships in 5 to 7 business days

This book presents the refereed proceedings of the 6th International Symposium on Algorithms and Computation, ISAAC '95, held in Cairns, Australia, in December 1995.
The 45 revised full papers presented together with the abstracts of three invited talks were selected from a total of 130 submissions. The papers address many current aspects of research and advanced applications of algorithms and computations; among the topics covered are graph theory and graph algorithms, computational geometry, computational logics, searching and sorting, approximation and optimization, algebraic manipulation, and coding.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $89.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

You Can Find This Book In

Non-Fiction Computing & I.T.Computer Programming & Software Development Algorithms & Data Structures Mathematics Mathematical Foundation Graphical & Digital Media Applications Computer Science Mathematical Theory of Computation Probability & Statistics Combinatorics & Graph Theory Applied Mathematics

Stochastics

Algorithmic Problems Arising from Genome Informatics	p. 1
An Approximation Algorithm for Alphabet Indexing Problem	p. 2
A Fast and Space-Economical Algorithm for Length-Limited Coding	p. 12
Computing in Linear Time a Chord from which a Simple Polygon is Weakly Internally Visible	p. 22
Competitive Searching in Polygons - Beyond Generalised Streets	p. 32
Finding a Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas	p. 42
Logspace Verifiers, NC, and NP	p. 52
Structure in Average Case Complexity	p. 62
Some Geometric Lower Bounds	p. 72
The I/O-Complexity of Ordered Binary-Decision Diagram Manipulation	p. 82
Two Arc Disjoint Paths in Eulerian Diagraphs	p. 92
Finding Dense Subgraphs	p. 102
Finding Smallest Supertrees	p. 112
Weighted Domination of Cocomparability Graphs	p. 122
The Parallel Complexity of Approximating the High Degree Subgraph Problem	p. 132
Constant Ratio Approximations of the Weighted Feedback Vertex Set Problem for Undirected Graphs	p. 142
Greedy Approximations of Independent Sets in Low Degree Graphs	p. 152
Practical Logic	p. 162
An Approximation Algorithm for MAX 3-SAT	p. 163
Learning of Restricted RNLC Graph Languages	p. 171
Optimal Information Delivery	p. 181
On the Complexity of Testing for Catastrophic Faults	p. 188
Scheduling Parallel Tasks with Individual Deadlines	p. 198
Orders of Gauss Periods in Finite Fields	p. 208
A Hard Problem that is Almost Always Easy	p. 216
Computing the Tutte Polynomial of a Graph of Moderate Size	p. 224
More Efficient Parallel Flow Algorithms	p. 234
Linear-time In-Place Selection in Less than 3n Comparisons	p. 244
Heap Construction: Optimal in Both Worst and Average Cases?	p. 254
Fast Approximate Dictionary Matching	p. 264
Undirected Vertex-Connectivity Structure and Smallest Four-Vertex-Connectivity Augmentation	p. 274
Searching for a Monotone Function by Independent Threshold Queries	p. 284
A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions	p. 291
Deciding Bisimulation and Trace Equivalences for Systems with Many Identical Processes	p. 301
Should Amdahl's Law be Repealed?	p. 311
Embeddings of Hyper-Rings in Hypercubes	p. 312
A Fast Algorithm for Computing Optimal Rectilinear Steiner Trees for Extremal Point Sets	p. 322
Algorithms for Finding f-Colorings of Partial k-Trees	p. 332
Spanning Closed Trail and Hamiltonian Cycle in Grid Graphs	p. 342
A Linear Time Algorithm for Finding Maximal Planar Subgraphs	p. 352
Illumination with Orthogonal Floodlights	p. 362
No Quadrangulation is Extremely Odd	p. 372
Finding the Medial Axis of a Simple Polygon in Linear Time	p. 382
The First Subquadratic Algorithm for Complete Linkage Clustering	p. 392
Matching Nuts and Bolts Faster	p. 402
Linear Matching-Time Algorithm for the Directed Graph Isomorphism Problem	p. 409
A Resource Assignment Problem on Graphs	p. 418
NC Algorithms for Partitioning Sparse Graphs into Induced Forests with an Application	p. 428
Author Index	p. 439
Table of Contents provided by Blackwell. All Rights Reserved.

Lecture Notes in Computer Science

6th International Symposium, ISAAC '95 Cairns, Australia, December 4 - 6, 1995. Proceedings Proceedings.

At a Glance

Paperback

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Stochastics

Monte Carlo and Quasi-Monte Carlo 2024

MCQMC 2024, Waterloo, Canada, August 18â"23

Game Theory

2nd edition

Introduction to Stochastic Processes

2nd Edition

Markov Chain Monte Carlo

Stochastic Simulation for Bayesian Inference

Chapman & Hall/CRC Numerical Analysis and Scientific Computi

Chapman & Hall/CRC Numerical Analysis and Scientific Computing Series

Logistic Regression

Bridging Theory and Practice

Occupancy Estimation and Modeling

Inferring Patterns and Dynamics of Species Occurrence

Copula Models for Dependent Competing Risks

Theory and applications in economics, engineering and medicine

Introduction to Stochastic Calculus with Applications (Third Edition)

Emerging Methodologies and Applications in Modelling, Identi

Emerging Methodologies and Applications in Modelling, Identification and Control

Convex and Variational Analysis with Applications

In Honor of Terry Rockafellar's 90th Birthday

Mathematics of Epidemics on Networks

From Exact to Approximate Models

Improving Tests for Discrete Small Sample Data

SpringerBriefs in Statistics

Ergodic Theory

A Probabilistic Approach to Dynamical Systems

A Guide to Generalized Functions

Linear, Nonlinear, Random, and Infinite Dimensional Distributions

Understanding Markov Chains

Examples and Applications

Information Theory, Probability and Statistical Learning

A Festschrift in Honor of Andrew Barron

Asymptotic and Methodological Statistics

Festschrift in Honor of Marie Huskova

Facets of Contemporary Analysis, Geometry and Non-Euclidean Statistics

HeKKSaGOn Mathematics Group Meetings, Kyoto and Sendai, September 2023

From Classical Analysis to Analysis on Fractals

A Tribute to Robert Strichartz, Volume 2

Intro to Stoch Calc with Appl

Springer Texts in Statistics

A Concise Course in Statistical Inference

Survival Analysis

Principles and Applications in Clinical Trials and Beyond

Quantitative Methods for Finance with Simulations II

Numerical Methods and Monte Carlo Integration

This product is categorised by