LEADER 01580nlm0 22004571i 450 
001 990009242470403321
010   $a9783540322887
035   $a000924247
035   $aFED01000924247
035   $a(Aleph)000924247FED01
035   $a000924247
100   $a20100926d2006----km-y0itay50------ba
101 0 $aeng
102   $aDE
135   $adrnn-008mamaa
200 1 $aSTACS 2006$bRisorsa elettronica$e23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006. Proceedings$fedited by Bruno Durand, Wolfgang Thomas
210   $aBerlin ; Heidelberg$cSpringer$d2006
225 1 $aLecture Notes in Computer Science$x0302-9743$v3884
230   $aDocumento elettronico
336   $aTesto
337   $aFormato html, pdf
702  1$aDurand,$bBruno
702  1$aThomas,$bWolfgang
801  0$aIT$bUNINA$gREICAT$2UNIMARC
856 4 $zFull text per gli utenti Federico II$uhttp://dx.doi.org/10.1007/11672142
901   $aEB
912   $a990009242470403321
961   $aAlgorithm Analysis and Problem Complexity
961   $aComputation by Abstract Devices
961   $aComputational complexity
961   $aComputer science
961   $aComputer Science
961   $aComputer software
961   $aData Structures
961   $aData structures (Computer science)
961   $aDiscrete Mathematics in Computer Science
961   $aLogic design
961   $aLogics and Meanings of Programs
961   $aMathematical Logic and Formal Languages
996   $aSTACS 2006$9772399
997   $aUNINA