000 03631nam a22005415i 4500
001 978-3-540-48337-3
003 DE-He213
005 20160624102033.0
007 cr nn 008mamaa
008 121227s1994 gw | s |||| 0|eng d
020 _a9783540483373
_9978-3-540-48337-3
024 7 _a10.1007/3-540-57811-0
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYZG
_2bicssc
072 7 _aCOM037000
_2bisacsh
082 0 4 _a004.0151
_223
245 1 0 _aAlgorithms and Complexity
_h[electronic resource] :
_bSecond Italian Conference, CIAC '94 Rome, Italy, February 23–25, 1994 Proceedings /
_cedited by M. Bonuccelli, P. Crescenzi, R. Petreschi.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1994.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1994.
300 _aIX, 227 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v778
505 0 _aOn the intellectual terrain around NP -- Advances in graph drawing -- On a parallel-algorithms method for string matching problems (overview) -- Some open problems in approximation -- New local search approximation techniques for maximum generalized satisfiability problems -- Learning behaviors of automata from multiplicity and equivalence queries -- Measures of Boolean function complexity based on Harmonic Analysis -- Graph theory and interactive protocols for Reachability Problems on finite Cellular automata -- Parallel pruning decomposition (PDS) and biconnected components of graphs -- A non-interactive electronic cash system -- A unified scheme for routing in expander based networks -- Dynamization of backtrack-free search for the constraint satisfaction problem -- Efficient reorganization of binary search trees -- Time-message trade-offs for the weak unison problem -- On set equality-testing -- On the complexity of some reachability problems -- On self-reducible sets of low information content -- Lower bounds for merging on the hypercube.
520 _aThe papers in this volume were presented at the Second Italian Conference onAlgorithms and Complexity, held in February 1994 in Rome. This biannual conference series is intended to present research contributions in theory and applications of sequential, parallel, and distributed algorithms, data structures, and computational complexity. The volume contains four invited presentations and 14 regular presentations selected from 32 submissions, each of which was evaluated by at least four program committee members. The invited presentations are by J. Hartmanis and S. Chari, A. Garg and R. Tamassia, S.C. Sahinalp and U. Vishkin, and M. Yannakakis.
650 0 _aComputer science.
650 0 _aData structures (Computer science).
650 0 _aComputer software.
650 0 _aCombinatorics.
650 1 4 _aComputer Science.
650 2 4 _aComputation by Abstract Devices.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aData Structures.
650 2 4 _aCombinatorics.
700 1 _aBonuccelli, M.
_eeditor.
700 1 _aCrescenzi, P.
_eeditor.
700 1 _aPetreschi, R.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540578116
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v778
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-57811-0
942 _2EBK6428
_cEBK
999 _c35722
_d35722