000			01754nam a22004815i 4500
001			978-3-540-32288-7
003			DE-He213
005			20130515021408.0
007			cr nn 008mamaa
008			100301s2006 gw | s |||| 0|eng d
020			_a9783540322887 _9978-3-540-32288-7
024	7		_a10.1007/11672142 _2doi
050		4	_aQA75.5-76.95
072		7	_aUYZG _2bicssc
072		7	_aCOM037000 _2bisacsh
082	0	4	_a004.0151 _223
100	1		_aDurand, Bruno.
245	1	0	_aSTACS 2006 _h[electronic resource] : _b23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006. Proceedings / _cedited by Bruno Durand, Wolfgang Thomas.
260			_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2006.
300			_bdigital.
490	0		_aLecture Notes in Computer Science, _x0302-9743 ; _v3884
650		0	_aComputer science.
650		0	_aData structures (Computer science).
650		0	_aComputer software.
650		0	_aLogic design.
650		0	_aComputational complexity.
650	1	4	_aComputer Science.
650	2	4	_aComputation by Abstract Devices.
650	2	4	_aAlgorithm Analysis and Problem Complexity.
650	2	4	_aLogics and Meanings of Programs.
650	2	4	_aMathematical Logic and Formal Languages.
650	2	4	_aData Structures.
650	2	4	_aDiscrete Mathematics in Computer Science.
700	1		_aThomas, Wolfgang.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783540323013
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v3884
856	4	0	_uhttp://dx.doi.org/10.1007/11672142
912			_aZDB-2-SCS
912			_aZDB-2-LNC
999			_c76829 _d76829