LEADER 05535oam 2200589 450 001 996466369203316 005 20210715122443.0 010 $a3-540-46632-0 024 7 $a10.1007/3-540-46632-0 035 $a(CKB)1000000000211335 035 $a(SSID)ssj0000321203 035 $a(PQKBManifestationID)11262341 035 $a(PQKBTitleCode)TC0000321203 035 $a(PQKBWorkID)10263100 035 $a(PQKB)10176410 035 $a(DE-He213)978-3-540-46632-1 035 $a(MiAaPQ)EBC3073124 035 $a(MiAaPQ)EBC6486036 035 $a(PPN)155219758 035 $a(EXLCZ)991000000000211335 100 $a20210715d1999 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 00$aAlgorithms and computations $e10th International Symposium, ISAAC'99, Chennai, India, December 16-18, 1999 proceedings /$fAlok Aggarwal, C. Pandu Rangan (Eds.) 205 $a1st ed. 1999. 210 1$aBerlin ;$aHeidelberg :$cSpringer,$d[1999] 210 4$d©1999 215 $a1 online resource (XIV, 454 p.) 225 1 $aLecture Notes in Computer Science ;$v1741 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-66916-7 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aInvited Talk -- The Engineering of Some Bipartite Matching Programs -- Session 1(a) - Data Structure I -- General Splay: A Basic Theory and Calculus -- Static Dictionaries Supporting Rank -- Session 1(b) - Parallel & Distributed Computing I -- Multiple Spin-Block Decisions -- Asynchronous Random Polling Dynamic Load Balancing -- Session 2(a) - Approximate Algorithm I -- Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colarability -- Hardness of Approximating Independent Domination in Circle Graphs -- Constant-Factor Approximation Algorithms for Domination Problems on Circle Graphs -- Session 2(b) - Computational Intelligence -- Ordered Binary Decision Diagrams as Knowledge-Bases -- Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots -- Session 3(a) - Online Algorithm -- On-Line Load Balancing of Temporary Tasks Revisited -- Online Routing in Triangulations -- Session 3(b) - Complexity Theory I -- The Query Complexity of Program Checking by Constant-Depth Circuits -- Tree-Like Resolution Is Superpolynomially Slower Than DAG-Like Resolution for the Pigeonhole Principle -- Session 4(a) - Approximate Algorithm II -- Efficient Approximation Algorithms for Multi-label Map Labeling -- Approximation Algorithms in Batch Processing -- Session 4(b) - Graph Algorithm I -- LexBFS-Ordering in Asteroidal Triple-Free Graphs -- Parallel Algorithms for Shortest Paths and Related Problems on Trapezoid Graphs -- Invited Talk -- Approximation Algorithms for Some Clustering and Classification Problems -- Session 5(a) - Computational Geometry I -- How Many People Can Hide in a Terrain? -- Carrying Umbrellas: An Online Relocation Problem on Graphs -- Session 5(b) - Parallel & Distributed Computing II -- Survivable Networks with Bounded Delay: The Edge Failure Case -- Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks -- Session 6(a) - Data Structure II -- Constructing the Suffix Tree of a Tree with a Large Alphabet -- An O(1) Time Algorithm for Generating Multiset Permutations -- Session 6(b) - Complexity Theory II -- Upper Bounds for MaxSat: Further Improved -- A Linear Time Algorithm for Recognizing Regular Boolean Functions -- Session 7(a) - Computational Geometry II -- Station Layouts in the Presence of Location Constraints -- Reverse Center Location Problem -- Session 7(b) - Algorithms in Practice -- Performance Comparison of Linear Sieve and Cubic Sieve Algorithms for Discrete Logarithms over Prime Fields -- External Memory Algorithms for Outerplanar Graphs -- Session 8(a) - Approximate Algorithm III -- A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree -- Approximation Algorithms for Channel Assignment with Constraints -- Session 8(b) - Graph Algorithm II -- Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs -- A Linear Algorithm for Finding Total Colorings of Partial k-Trees -- Invited Talk -- Topology-Oriented Approach to Robust Geometric Computation -- Session 9(a) - Approximate Algorithm IV -- Approximating Multicast Congestion -- Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts -- Session 9(b) - Parallel & Distributed Computing III -- Online Scheduling of Parallel Communications with Individual Deadlines -- A Faster Algorithm for Finding Disjoint Paths in Grids -- Session 10(a) - Computational Geometry III -- Output-Sensitive Algorithms for Uniform Partitions of Points -- Convexifying Monotone Polygons -- Session 10(b) - Graph Algorithm III -- Bisecting Two Subsets in 3-Connected Graphs -- Generalized Maximum Independent Sets for Trees in Subquadratic Time. 410 0$aLecture notes in computer science ;$v1741. 606 $aComputer science$vCongresses 606 $aComputer software$vCongresses 615 0$aComputer science 615 0$aComputer software 676 $a004 702 $aAggarwal$b Alok 702 $aPandu Rangan$b C.$f1955- 712 12$aISAAC (Conference) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bUtOrBLW 906 $aBOOK 912 $a996466369203316 996 $aAlgorithms and computations$92240113 997 $aUNISA LEADER 01200nam 2200409 450 001 9910796313903321 005 20230803015728.0 010 $a2-8062-4550-8 035 $a(CKB)3820000000022918 035 $a(MiAaPQ)EBC4466474 035 $a(Au-PeEL)EBL4466474 035 $a(CaPaEBR)ebr11190846 035 $a(OCoLC)946263408 035 $a(EXLCZ)993820000000022918 100 $a20160513h20132013 uy 0 101 0 $afre 135 $aurcnu|||||||| 181 $2rdacontent 182 $2rdamedia 183 $2rdacarrier 200 10$aCritique de la faculte? de juger de Kant $eDe l'art en ge?ne?ral /$fpar Quentin Molinier 210 1$aBruxelles, [Belgium] :$clePetitPhilosophe.fr,$d2013. 210 4$d©2013 215 $a1 online resource (21 pages) 225 1 $aCommentaires Philosophie 410 0$aCollection Commentaires philosophiques. 606 $aJudgment (Logic) 615 0$aJudgment (Logic) 676 $a121 700 $aMolinier$b Quentin$01491762 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910796313903321 996 $aCritique de la faculte? de juger de Kant$93713737 997 $aUNINA