Computing and Combinatorics (Record no. 188354)

MARC details
000 -LEADER
fixed length control field 06678nam a22006135i 4500
001 - CONTROL NUMBER
control field 978-3-540-68535-7
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240423132506.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 121227s1998 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783540685357
-- 978-3-540-68535-7
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/3-540-68535-9
Source of number or code doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.9.A43
072 #7 - SUBJECT CATEGORY CODE
Subject category code UMB
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code COM051300
Source bisacsh
072 #7 - SUBJECT CATEGORY CODE
Subject category code UMB
Source thema
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 518.1
Edition number 23
245 10 - TITLE STATEMENT
Title Computing and Combinatorics
Medium [electronic resource] :
Remainder of title 4th Annual International Conference, COCOON’98, Taipei, Taiwan, R.o.C., August 12–14, 1998 /
Statement of responsibility, etc edited by Wen-Lian Hsu, Ming-Yang Kao.
250 ## - EDITION STATEMENT
Edition statement 1st ed. 1998.
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg :
-- Imprint: Springer,
-- 1998.
300 ## - PHYSICAL DESCRIPTION
Extent XII, 372 p.
Other physical details online resource.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
490 1# - SERIES STATEMENT
Series statement Lecture Notes in Computer Science,
International Standard Serial Number 1611-3349 ;
Volume number/sequential designation 1449
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Invited Presentations -- Algorithmic Approaches to Information Retrieval and Data Mining -- Combinatorial Problems Arising in Massive Data Sets -- Estimating Parameters of Monotone Boolean Functions -- De-amortization of Algorithms -- Computational Geometry -- On Computing New Classes of Optimal Triangulations with Angular Constraints -- Maximum Weight Triangulation and Its Application on Graph Drawing -- The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries -- Space-Efficient Algorithms for Approximating Polygonal Curves in Two Dimensional Space -- Parallel Geometric Algorithms in Coarse-Grain Network Models -- Algorithms and Data Structures -- On the Bahncard Problem -- The Ultimate Strategy to Search on m Rays? -- Better Approximation of Diagonal-Flip Transformation and Rotation Transformation -- A Cost Optimal Parallel Algorithm for Computing Force Field in N-Body Simulations -- Efficient 2 and 3-Flip Neighborhood Search Algorithms for the MAX SAT -- Algorithms for Almost-Uniform Generation with an Unbiased Binary Source -- Improved Algorithms for Chemical Threshold Testing Problems -- Min-Max-Boundary Domain Decomposition -- Computational Complexity -- On Boolean Lowness and Boolean Highness -- The Inherent Dimension of Bounded Counting Classes -- An Exact Characterization of Symmetric Functions in q AC 0[2] -- Robust Reductions -- Approaches to Effective Semi-continuity of Real Functions -- On the Power of Additive Combinatorial Search Model -- Parallel and Distributed Processing, and Switching Networks -- The Number of Rearrangements in a 3-stage Clos Network Using an Auxiliary Switch -- Lower Bounds for Wide-Sense Non-blocking Clos Network -- Multirate Multicast Switching Networks -- Efficient Randomized Routing Algorithms onthe Two-Dimensional Mesh of Buses -- Executing Divisible Jobs on a Network with a Fixed Number of Processors -- Graph Theory -- On the Ádám Conjecture on Circulant Graphs -- Proof of Toft’s Conjecture: Every Graph Containing No Fully Odd K 4 Is 3-Colorable -- A New Family of Optimal 1-Hamiltonian Graphs with Small Diameter -- A Linear-Time Algorithm for Constructing an Optimal Node-Search Strategy of a Tree -- A Graph Optimization Problem in Virtual Colonoscopy -- Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices -- An Optimal Algorithm for Finding the Minimum Cardinality Dominating Set on Permutation Graphs -- Combinatorics and Cryptography -- Similarity in Two-Dimensional Strings -- On Multi-dimensional Hilbert Indexings -- Combinatorial Properties of Classes of Functions Hard to Compute in Constant Depth -- Eulerian Secret Key Exchange -- One-Time Tables for Two-Party Computation.
520 ## - SUMMARY, ETC.
Summary, etc The papers in this volume were selected for presentation at the Fourth Annual International Computing and Combinatorics Conference (COCOON’98), held on August 12–14, 1998, in Taipei. The topics cover most aspects of theoretical computer science and combinatorics related to computing. Submissions to the conference this year was only conducted electronically. Thanks to the excellent software developed by the system team of the Institute of Information Science, we were able to make virtually all communications through the World Wide Web. A total of 69 papers was submitted in time to be considered, of which 36 papers were accepted for presentation at the conference. In addition to these contributed papers, the conference also included four invited presentations by Christo Papadimitriou, Michael Fishcher, Fan Chung Graham and Rao Kosaraju. It is expected that most of the accepted papers will appear in a more complete form in scienti?c journals. Moreover, selected papers will appear in a special issue of Theoretical Computer Science. We thank all program committee members, their support sta? and referees for excellent work within demanding time constraints. We thank all authors who submitted papers for consideration. We are especially grateful to our colleagues who worked hard and o?ered widely di?ering talents to make the conference both possible and enjoyable. August 1998 Wen-Lian Hsu and Ming-Yang Kao Program Co-chairs COCOON’98 Organization COCOON’98 is organized by the Institute of Information Science, Academia Sinica, Taipei, Taiwan, ROC and in cooperation with Institute of Information and Computing Machinery (IICM), Taiwan, ROC.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Algorithms.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer science
General subdivision Mathematics.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Discrete mathematics.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Artificial intelligence
General subdivision Data processing.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer networks .
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Algorithms.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Discrete Mathematics in Computer Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Data Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer Communication Networks.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Discrete Mathematics.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Hsu, Wen-Lian.
Relator term editor.
Relator code edt
-- http://id.loc.gov/vocabulary/relators/edt
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Kao, Ming-Yang.
Relator term editor.
Relator code edt
-- http://id.loc.gov/vocabulary/relators/edt
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title Springer Nature eBook
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783540648246
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783662196571
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Lecture Notes in Computer Science,
-- 1611-3349 ;
Volume number/sequential designation 1449
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://doi.org/10.1007/3-540-68535-9">https://doi.org/10.1007/3-540-68535-9</a>
912 ## -
-- ZDB-2-SCS
912 ## -
-- ZDB-2-SXCS
912 ## -
-- ZDB-2-LNC
912 ## -
-- ZDB-2-BAE
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks-CSE-Springer

No items available.

© 2024 IIIT-Delhi, library@iiitd.ac.in