Borrow it
 African Studies Library
 Alumni Medical Library
 Astronomy Library
 Fineman and Pappas Law Libraries
 Frederick S. Pardee Management Library
 Howard Gotlieb Archival Research Center
 Mugar Memorial Library
 Music Library
 Pikering Educational Resources Library
 School of Theology Library
 Science & Engineering Library
 Stone Science Library
The Resource Algorithms and Computation : 4th International Symposium, ISAAC '93 Hong Kong, December 15–17, 1993 Proceedings, edited by K. W. Ng, P. Raghavan, N. V. Balasubramanian, F. Y. L. Chin, (electronic resource)
Algorithms and Computation : 4th International Symposium, ISAAC '93 Hong Kong, December 15–17, 1993 Proceedings, edited by K. W. Ng, P. Raghavan, N. V. Balasubramanian, F. Y. L. Chin, (electronic resource)
Resource Information
The item Algorithms and Computation : 4th International Symposium, ISAAC '93 Hong Kong, December 15–17, 1993 Proceedings, edited by K. W. Ng, P. Raghavan, N. V. Balasubramanian, F. Y. L. Chin, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.This item is available to borrow from all library branches.
Resource Information
The item Algorithms and Computation : 4th International Symposium, ISAAC '93 Hong Kong, December 15–17, 1993 Proceedings, edited by K. W. Ng, P. Raghavan, N. V. Balasubramanian, F. Y. L. Chin, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.
This item is available to borrow from all library branches.
 Summary
 This volume presents the proceedings of the fourth annual International Symposium on Algorithms and Computation, held in Hong Kong in December 1993.Numerous selected papers present original research in such areas as design and analysis of algorithms, computational complexity, and theory of computation. Topics covered include:  automata, languages, and computability,  combinatorial, graph, geometric, and randomized algorithms,  networks and distributed algorithms,  VLSIand parallel algorithms,  theory of learning and robotics,  number theory and robotics. Three invited papers are also included
 Language
 eng
 Extent
 XIII, 546 p.
 Contents

 Reaching a goal with directional uncertainty
 Constructing degree3 spanners with other sparseness properties
 Remembering conflicts in history yields dynamic algorithms
 Coloring random graphs in polynomial expected time
 Graphical degree sequence problems with connectivity requirements
 How to treat delete requests in semionline problems
 Finding the shortest watchman route in a simple polygon
 Constructing shortest watchman routes by divideandconquer
 A graph coloring result and its consequences for some guarding problems
 The maximum kdependent and fdependent set problem
 Finding shortest noncrossing rectilinear paths in plane regions
 Treewidth of circle graphs
 A framework for constructing heaplike structures inplace
 Doubleended binomial queues
 A simple balanced search tree with O(1) worstcase update time
 Mapping dynamic data and algorithm structures into product networks
 Permutation routing on reconfigurable meshes
 Adaptive and oblivious algorithms for dcube permutation routing
 On quadratic lattice approximations
 A 2/3approximation of the matroid matching problem
 Using fractal geometry for solving divideandconquer recurrences
 Simple combinatorial Gray codes constructed by reversing sublists
 Time space tradeoffs (getting closer to the barrier?)
 Separating exponentially ambiguous NFA from polynomially ambiguous NFA
 Threshold computation and cryptographic security
 On the Power of reading and writing simultaneously in parallel computations
 Relativizing complexity classes with Random Oracles
 An introduction to perpetual gossiping
 A probabilistic selection network with butterfly networks
 Optimal group gossiping in hypercubes under wormhole routing model
 Optimal linear broadcast routing with capacity limitations
 Multicommodity flows: A survey of recent research
 Parallel construction of canonical ordering and convex drawing of triconnected planar graphs
 Number theory helps line detection in digital images an extended abstract
 Optimally computing the shortest weakly visible subedge of a simple polygon preliminary version
 Multicommodity flows in even, planar networks
 Linear time algorithms for disjoint TwoFace Paths Problems in planar graphs
 Robot mapping: Footprints vs tokens
 Recent developments on the approximability of combinatorial problems
 On the relationship among cryptographic physical assumptions
 Separating complexity classes related to bounded alternating ?branching programs
 The complexity of the optimal variable ordering problems of shared binary decision diagrams
 On Horn envelopes and hypergraph transversals
 Page migration algorithms using work functions
 Memory paging for connectivity and path problems in graphs
 Randomized competitive algorithms for successful and unsuccessful search on selfadjusting linear lists
 Randomized online algorithms for the page replication problem
 New algorithms for minimizing the longest wire length during circuit compaction
 Parallel algorithms for singlelayer channel routing
 Consecutive interval query and dynamic programming on intervals
 An improved algorithm for the traveler's problem
 Vehicle scheduling on a tree with release and handling times
 Scheduling algorithms for a chainlike task system
 Weighted independent perfect domination on cocomparability graphs
 Plane sweep algorithms for the polygonal approximation problems with applications
 Optimal rectilinear steiner tree for extremal point sets
 Faster approximation algorithms for the rectilinear steiner tree problem
 Isbn
 9783540482338
 Label
 Algorithms and Computation : 4th International Symposium, ISAAC '93 Hong Kong, December 15–17, 1993 Proceedings
 Title
 Algorithms and Computation
 Title remainder
 4th International Symposium, ISAAC '93 Hong Kong, December 15–17, 1993 Proceedings
 Statement of responsibility
 edited by K. W. Ng, P. Raghavan, N. V. Balasubramanian, F. Y. L. Chin
 Subject

 Computation by Abstract Devices
 Computer graphics
 Probability Theory and Stochastic Processes
 Computer Graphics
 Computer science
 Computer science
 Information Storage and Retrieval
 Statistics, general
 Information storage and retrieval systems
 Combinatorics
 Computer Science
 Computer graphics
 Computer Science
 Distribution (Probability theory)
 Statistics
 Distribution (Probability theory)
 Combinatorics
 Computer Graphics
 Computer graphics
 Electronic resources
 Statistics
 Information storage and retrieval systems
 Combinatorics
 Distribution (Probability theory)
 Statistics
 Information storage and retrieval systems
 Computer Science
 Computer Graphics
 Computer science
 Language
 eng
 Summary
 This volume presents the proceedings of the fourth annual International Symposium on Algorithms and Computation, held in Hong Kong in December 1993.Numerous selected papers present original research in such areas as design and analysis of algorithms, computational complexity, and theory of computation. Topics covered include:  automata, languages, and computability,  combinatorial, graph, geometric, and randomized algorithms,  networks and distributed algorithms,  VLSIand parallel algorithms,  theory of learning and robotics,  number theory and robotics. Three invited papers are also included
 http://library.link/vocab/creatorName
 Ng, K. W
 Image bit depth
 0
 LC call number
 QA75.576.95
 Literary form
 non fiction
 http://library.link/vocab/relatedWorkOrContributorName

 Raghavan, P.
 Balasubramanian, N. V.
 Chin, F. Y. L.
 SpringerLink
 Series statement
 Lecture Notes in Computer Science,
 Series volume
 762
 http://library.link/vocab/subjectName

 Computer science
 Information storage and retrieval systems
 Computer graphics
 Combinatorics
 Distribution (Probability theory)
 Statistics
 Computer Science
 Computation by Abstract Devices
 Combinatorics
 Probability Theory and Stochastic Processes
 Statistics, general
 Information Storage and Retrieval
 Computer Graphics
 Label
 Algorithms and Computation : 4th International Symposium, ISAAC '93 Hong Kong, December 15–17, 1993 Proceedings, edited by K. W. Ng, P. Raghavan, N. V. Balasubramanian, F. Y. L. Chin, (electronic resource)
 Antecedent source
 mixed
 Carrier category
 online resource
 Carrier category code
 cr
 Carrier MARC source
 rdacarrier
 Color
 not applicable
 Content category
 text
 Content type code
 txt
 Content type MARC source
 rdacontent
 Contents
 Reaching a goal with directional uncertainty  Constructing degree3 spanners with other sparseness properties  Remembering conflicts in history yields dynamic algorithms  Coloring random graphs in polynomial expected time  Graphical degree sequence problems with connectivity requirements  How to treat delete requests in semionline problems  Finding the shortest watchman route in a simple polygon  Constructing shortest watchman routes by divideandconquer  A graph coloring result and its consequences for some guarding problems  The maximum kdependent and fdependent set problem  Finding shortest noncrossing rectilinear paths in plane regions  Treewidth of circle graphs  A framework for constructing heaplike structures inplace  Doubleended binomial queues  A simple balanced search tree with O(1) worstcase update time  Mapping dynamic data and algorithm structures into product networks  Permutation routing on reconfigurable meshes  Adaptive and oblivious algorithms for dcube permutation routing  On quadratic lattice approximations  A 2/3approximation of the matroid matching problem  Using fractal geometry for solving divideandconquer recurrences  Simple combinatorial Gray codes constructed by reversing sublists  Time space tradeoffs (getting closer to the barrier?)  Separating exponentially ambiguous NFA from polynomially ambiguous NFA  Threshold computation and cryptographic security  On the Power of reading and writing simultaneously in parallel computations  Relativizing complexity classes with Random Oracles  An introduction to perpetual gossiping  A probabilistic selection network with butterfly networks  Optimal group gossiping in hypercubes under wormhole routing model  Optimal linear broadcast routing with capacity limitations  Multicommodity flows: A survey of recent research  Parallel construction of canonical ordering and convex drawing of triconnected planar graphs  Number theory helps line detection in digital images an extended abstract  Optimally computing the shortest weakly visible subedge of a simple polygon preliminary version  Multicommodity flows in even, planar networks  Linear time algorithms for disjoint TwoFace Paths Problems in planar graphs  Robot mapping: Footprints vs tokens  Recent developments on the approximability of combinatorial problems  On the relationship among cryptographic physical assumptions  Separating complexity classes related to bounded alternating ?branching programs  The complexity of the optimal variable ordering problems of shared binary decision diagrams  On Horn envelopes and hypergraph transversals  Page migration algorithms using work functions  Memory paging for connectivity and path problems in graphs  Randomized competitive algorithms for successful and unsuccessful search on selfadjusting linear lists  Randomized online algorithms for the page replication problem  New algorithms for minimizing the longest wire length during circuit compaction  Parallel algorithms for singlelayer channel routing  Consecutive interval query and dynamic programming on intervals  An improved algorithm for the traveler's problem  Vehicle scheduling on a tree with release and handling times  Scheduling algorithms for a chainlike task system  Weighted independent perfect domination on cocomparability graphs  Plane sweep algorithms for the polygonal approximation problems with applications  Optimal rectilinear steiner tree for extremal point sets  Faster approximation algorithms for the rectilinear steiner tree problem
 Dimensions
 unknown
 Extent
 XIII, 546 p.
 File format
 multiple file formats
 Form of item
 electronic
 Isbn
 9783540482338
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Other control number
 10.1007/3540575685
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (DEHe213)9783540482338
 Label
 Algorithms and Computation : 4th International Symposium, ISAAC '93 Hong Kong, December 15–17, 1993 Proceedings, edited by K. W. Ng, P. Raghavan, N. V. Balasubramanian, F. Y. L. Chin, (electronic resource)
 Antecedent source
 mixed
 Carrier category
 online resource
 Carrier category code
 cr
 Carrier MARC source
 rdacarrier
 Color
 not applicable
 Content category
 text
 Content type code
 txt
 Content type MARC source
 rdacontent
 Contents
 Reaching a goal with directional uncertainty  Constructing degree3 spanners with other sparseness properties  Remembering conflicts in history yields dynamic algorithms  Coloring random graphs in polynomial expected time  Graphical degree sequence problems with connectivity requirements  How to treat delete requests in semionline problems  Finding the shortest watchman route in a simple polygon  Constructing shortest watchman routes by divideandconquer  A graph coloring result and its consequences for some guarding problems  The maximum kdependent and fdependent set problem  Finding shortest noncrossing rectilinear paths in plane regions  Treewidth of circle graphs  A framework for constructing heaplike structures inplace  Doubleended binomial queues  A simple balanced search tree with O(1) worstcase update time  Mapping dynamic data and algorithm structures into product networks  Permutation routing on reconfigurable meshes  Adaptive and oblivious algorithms for dcube permutation routing  On quadratic lattice approximations  A 2/3approximation of the matroid matching problem  Using fractal geometry for solving divideandconquer recurrences  Simple combinatorial Gray codes constructed by reversing sublists  Time space tradeoffs (getting closer to the barrier?)  Separating exponentially ambiguous NFA from polynomially ambiguous NFA  Threshold computation and cryptographic security  On the Power of reading and writing simultaneously in parallel computations  Relativizing complexity classes with Random Oracles  An introduction to perpetual gossiping  A probabilistic selection network with butterfly networks  Optimal group gossiping in hypercubes under wormhole routing model  Optimal linear broadcast routing with capacity limitations  Multicommodity flows: A survey of recent research  Parallel construction of canonical ordering and convex drawing of triconnected planar graphs  Number theory helps line detection in digital images an extended abstract  Optimally computing the shortest weakly visible subedge of a simple polygon preliminary version  Multicommodity flows in even, planar networks  Linear time algorithms for disjoint TwoFace Paths Problems in planar graphs  Robot mapping: Footprints vs tokens  Recent developments on the approximability of combinatorial problems  On the relationship among cryptographic physical assumptions  Separating complexity classes related to bounded alternating ?branching programs  The complexity of the optimal variable ordering problems of shared binary decision diagrams  On Horn envelopes and hypergraph transversals  Page migration algorithms using work functions  Memory paging for connectivity and path problems in graphs  Randomized competitive algorithms for successful and unsuccessful search on selfadjusting linear lists  Randomized online algorithms for the page replication problem  New algorithms for minimizing the longest wire length during circuit compaction  Parallel algorithms for singlelayer channel routing  Consecutive interval query and dynamic programming on intervals  An improved algorithm for the traveler's problem  Vehicle scheduling on a tree with release and handling times  Scheduling algorithms for a chainlike task system  Weighted independent perfect domination on cocomparability graphs  Plane sweep algorithms for the polygonal approximation problems with applications  Optimal rectilinear steiner tree for extremal point sets  Faster approximation algorithms for the rectilinear steiner tree problem
 Dimensions
 unknown
 Extent
 XIII, 546 p.
 File format
 multiple file formats
 Form of item
 electronic
 Isbn
 9783540482338
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code
 c
 Other control number
 10.1007/3540575685
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (DEHe213)9783540482338
Subject
 Combinatorics
 Combinatorics
 Combinatorics
 Computation by Abstract Devices
 Computer Graphics
 Computer Graphics
 Computer Graphics
 Computer Science
 Computer Science
 Computer Science
 Computer graphics
 Computer graphics
 Computer graphics
 Computer science
 Computer science
 Computer science
 Distribution (Probability theory)
 Distribution (Probability theory)
 Distribution (Probability theory)
 Electronic resources
 Information Storage and Retrieval
 Information storage and retrieval systems
 Information storage and retrieval systems
 Information storage and retrieval systems
 Probability Theory and Stochastic Processes
 Statistics
 Statistics
 Statistics
 Statistics, general
Member of
Library Locations

African Studies LibraryBorrow it771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US42.350723 71.108227


Astronomy LibraryBorrow it725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US42.350259 71.105717

Fineman and Pappas Law LibrariesBorrow it765 Commonwealth Avenue, Boston, MA, 02215, US42.350979 71.107023

Frederick S. Pardee Management LibraryBorrow it595 Commonwealth Avenue, Boston, MA, 02215, US42.349626 71.099547

Howard Gotlieb Archival Research CenterBorrow it771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US42.350723 71.108227


Music LibraryBorrow it771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350723 71.108227

Pikering Educational Resources LibraryBorrow it2 Silber Way, Boston, MA, 02215, US42.349804 71.101425

School of Theology LibraryBorrow it745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350494 71.107235

Science & Engineering LibraryBorrow it38 Cummington Mall, Boston, MA, 02215, US42.348472 71.102257

Embed (Experimental)
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.bu.edu/portal/AlgorithmsandComputation4thInternational/Q44judfKTPY/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/AlgorithmsandComputation4thInternational/Q44judfKTPY/">Algorithms and Computation : 4th International Symposium, ISAAC '93 Hong Kong, December 15–17, 1993 Proceedings, edited by K. W. Ng, P. Raghavan, N. V. Balasubramanian, F. Y. L. Chin, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Algorithms and Computation : 4th International Symposium, ISAAC '93 Hong Kong, December 15–17, 1993 Proceedings, edited by K. W. Ng, P. Raghavan, N. V. Balasubramanian, F. Y. L. Chin, (electronic resource)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.bu.edu/portal/AlgorithmsandComputation4thInternational/Q44judfKTPY/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/AlgorithmsandComputation4thInternational/Q44judfKTPY/">Algorithms and Computation : 4th International Symposium, ISAAC '93 Hong Kong, December 15–17, 1993 Proceedings, edited by K. W. Ng, P. Raghavan, N. V. Balasubramanian, F. Y. L. Chin, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>