000755798 000__ 04418cam\a2200541Ii\4500
000755798 001__ 755798
000755798 005__ 20230306141813.0
000755798 006__ m\\\\\o\\d\\\\\\\\
000755798 007__ cr\cn\nnnunnun
000755798 008__ 160609s2016\\\\sz\a\\\\o\\\\\101\0\eng\d
000755798 019__ $$a951071162
000755798 020__ $$a9783319388519$$q(electronic book)
000755798 020__ $$a3319388517$$q(electronic book)
000755798 020__ $$z9783319388502
000755798 020__ $$z3319388509
000755798 035__ $$aSP(OCoLC)ocn951465536
000755798 035__ $$aSP(OCoLC)951465536$$z(OCoLC)951071162
000755798 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dOCLCO$$dYDXCP$$dUPM
000755798 049__ $$aISEA
000755798 050_4 $$aQA76.9.A43
000755798 08204 $$a005.1$$223
000755798 1112_ $$aSEA (Symposium)$$n(15th :$$d2016 :$$cSaint Petersburg, Russia)
000755798 24510 $$aExperimental algorithms$$h[electronic resource] :$$b15th International Symposium, SEA 2016, St. Petersburg, Russia, June 5-8, 2016, proceedings /$$cAndrew V. Goldberg, Alexander S. Kulikov (eds.).
000755798 2463_ $$aSEA 2016
000755798 264_1 $$aSwitzerland :$$bSpringer,$$c2016.
000755798 300__ $$a1 online resource (xvi, 386 pages) :$$billustrations.
000755798 336__ $$atext$$btxt$$2rdacontent
000755798 337__ $$acomputer$$bc$$2rdamedia
000755798 338__ $$aonline resource$$bcr$$2rdacarrier
000755798 4901_ $$aLecture notes in computer science ;$$v9685
000755798 4901_ $$aLNCS sublibrary. SL 2, Programming and software engineering
000755798 500__ $$aInternational conference proceedings.
000755798 500__ $$aIncludes author index.
000755798 5050_ $$aPractical Variable Length Gap Pattern Matching using Wavelet Trees -- Fast Exact Computation of Isochrones in Road Networks -- Dynamic Time-Dependent Route Planning in Road Networks with User Preferences -- UKP5: a New Algorithm for the Unbounded Knapsack Problem -- Lempel-Ziv Decoding in External Memory -- A Practical Method for the Minimum Genus of a Graph: Models and Experiments -- Compact Flow Diagrams for State Sequences -- Practical Dynamic Entropy-Compressed Bitvectors with Applications -- Accelerating Local Search for the Maximum Independent Set Problem -- Computing Nonsimple Polygons of Minimum Perimeter -- Sparse Subgraphs for 2-Connectivity in Directed Graphs -- Worst-Case-Efficient Dynamic Arrays in Practice -- On the Solution of Circulant Weighing Matrices Problems Using Algorithm Portfolios on Multi-Core Processors -- Engineering Hybrid DenseZDDs -- Steiner Tree Heuristic in the Euclidean d-Space Using Bottleneck Distances -- Tractable Pathfinding for the Stochastic On-Time Arrival Problem -- An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem -- Experimental Analysis of Algorithms for Coflow Scheduling -- An Empirical Study of Online Packet Scheduling Algorithms -- Advanced Multilevel Node Separator Algorithms -- A merging heuristic for the rectangle decomposition of binary matrice -- CHICO: A Compressed Hybrid Index for Repetitive Collections -- Fast Scalable Construction of (Minimal Perfect Hash) Functions -- Better partitions of protein graphs for subsystem quantum chemistry -- Online Algorithm for Approximate Quantile Queries on Sliding Windows.
000755798 506__ $$aAccess limited to authorized users.
000755798 520__ $$aThis book constitutes the refereed proceedings of the 15th International Symposium on Experimental Algorithms, SEA 2016, held in St. Petersburg, Russia, in June 2016. The 25 revised full papers presented were carefully reviewed and selected from 54 submissions. The main theme of the symposium is the role of experimentation and of algorithm engineering techniques in the design and evaluation of algorithms and data structures. SEA covers a wide range of topics in experimental algorithmics, bringing together researchers from algorithm engineering, mathematical programming, and combinatorial optimization communities.
000755798 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed June 9, 2016).
000755798 650_0 $$aComputer algorithms$$vCongresses.
000755798 650_0 $$aSoftware engineering$$vCongresses.
000755798 7001_ $$aGoldberg, Andrew V.,$$eeditor.
000755798 7001_ $$aKulikov, Alexander S.,$$eeditor.
000755798 77608 $$iPrint version:$$z9783319388502$$z3319388509$$w(OCoLC)946908032
000755798 830_0 $$aLecture notes in computer science ;$$v9685.
000755798 830_0 $$aLNCS sublibrary.$$nSL 2,$$pProgramming and software engineering.
000755798 852__ $$bebk
000755798 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-319-38851-9$$zOnline Access$$91397441.1
000755798 909CO $$ooai:library.usi.edu:755798$$pGLOBAL_SET
000755798 980__ $$aEBOOK
000755798 980__ $$aBIB
000755798 982__ $$aEbook
000755798 983__ $$aOnline
000755798 994__ $$a92$$bISE