ระบบห้องสมุดอัตโนมัติคณะวิศวกรรมศาสตร์

แสดงรายละเอียดบรรณานุกรม

กลับหน้าหลัก

Brief Record : Get Marc (ISO 2709) : E-mail record : QR code

ปิดหน้าต่าง

LEADER 00000nam 2200000uu 4500
001 13399112654
003 ULIBM
008 120717s\|\|\|\|\|\|\|\|th 000 0 tha d
020 0471585521
020 9783540602460 (Berlin)
040 NRU^beng^cRRR^dDLC^dBAKER^dC^Q^dNLGGC^dBTCTA^dYDXCP^dOCLCG^dOCLCQ^dZWZ^dDEBBG^dUWW^dGW5XE^dOCLCQ
042 lccopycat
050 00 QA76.9.M35^bS96 1995
111 2 Symposium on Mathematical Foundations of Computer Science(1972- )^n(20th :^d1995 :^cPrague, Czech Republic)
245 10 Mathematical foundations of computer science 1995 :^b20thinternational symposium, MFCS ^'95, Prague, Czech Republic,August 28-September 1, 1995 : proceedings /^cJirํ Wiedermann, Petr Hแjek, eds.
260 Berlin ;^aNew York :^bSpringer,^cc1995.
300 xiii, 588 p. :^bill. ;^c24 cm.
490 1 Lecture notes in computer science ;^v969
504 Includes bibliographical references and index.
505 0 Scheduling parallel communication / M. Adler, J.W. Byers,R.M. Karp -- Decomposable structures, boolean function representations, and optimization / S. Arnborg -- The complexity of interval routing on random graphs / M. Flammini, J. van Leeuwen, A. Marchetti-Spaccamela -- Bridging across the log(n) space frontier / V. Geffert -- Second order logic and the weak exponential hierarchies / G. Gottlob, N. Leone, H. Veith -- On the computing paradigm and computational complexity / J. Hartmanis -- Ranked structures in nonmonotonic reasoning and belief revision / D. Lehmann -- Symbolic dynamics and finite automata / D. Perrin -- Lower bounds for propositional proofs and independence results in bounded arithmetic / A.A. Razborov -- Physics and the new computation / P. Vitanyi -- Measure on P: robustness of the notion / E. Allender, M. Strauss -- Comparing counting classes for logspace, one-way logspace, and first-order / H.-J. Burtschick -- Automata that take advice / C. Damm, M. Holzer -- Nonuniform lower bounds for exponential time classes / S. Homer, S. Mocas -- On a quantitative notion of uniformity / S. Kaufmann, M. Kummer -- Separations by random oracles and ^"almost^" classes for generalized reducibilities / W. Merkle, Y. Wang -- On the complexity of finite memory policies for markov decision processes / D. Beauquier, D. Burago, A. Slissenko -- Derandomization for sparse approximations and independent sets / T. Hofmeister, H. Lefmann -- Asymptotically efficient in-place merging / J. Katajainen, T. Pasanen, G. Titan -- Thecomplexity of the falsifiability problem for pure implicational formulas / P. Heusch -- Strong lower bounds on the approximability of some NPO PB-complete maximization problems / V. Kann -- Some typical propertiesof large and/or boolean formulas / H. Lefmann, P. Savicky -- The hedge: an efficient storage device for turing machines with one head / M. Huhne -- Graph inference from a walk for trees of bounded degree 3 is np-complete / O. Maruyama, S. Miyano -- Honeycomb networks / I. Stojmenovic-- Witness-isomorphic reductions and the local search problem / S. Fischer, L. Hemaspaandra, L. Torenvliet -- Multiple product modulo arbitrary numbers / C. Bertram-Kretzberg, T. Hofmeister -- Lower bounds for the majority communication complexity of various graph accessibility problems / Ch. Meinel, S. Waack -- Strong optimal lower bounds for turing machines that accept nonregular languages / A. Bertoni, C. Mereghetti, G. Pighizzini -- A superpolynomial lower bound for (1, +k(n))-branching programs / S. Zak -- Deterministic parsing for augmented context-free grammars / L. Breveglieri, A. Cherubini, S. Crespi-Reghizzi -- A periodicity theorem on words and applications / F. Mignosi, A. Restivo, S. Salemi -- A new approach to analyse coupled-context-free languages / G. Hotz, G. Pitsch -- Computational complexity of simultaneous elementary matching problems / M. Hermann, P.G. Kolaitis -- Graph reducibility of term rewriting systems / M.R.K. Krishna Rao -- Positive recursive type assignment / P. Urzyczyn -- String recognition on anonymous rings / E. Kranakis, D. Krizanc, F.L. Luccio -- The firing squad synchronization problem on Cayley graphs / Z. Roka -- Solving cheap graph problems on meshes / J.F.Sibeyn, M. Kaufmann -- An elementary bisimulation decisionprocedure for arbitrary context-free processes / O. Burkart, D. Caucal, B. Steffen -- On congruences and partial orders / S. Bauget, P. Gastin -- Performance preorder / F. Corradini, R. Gorrieri, M. Roccetti -- Towards a semantic theory of CML / W. Ferreira, M. Hennessy -- Modular constructions of distributing automata/ S. Huguet, A. Petit -- On the proof method for bisimulation / D. Sangiorgi -- Towards a calculus of predicate transformers / C. Martin -- An abstract account of composition / M. Abadi, S. Merz -- Syntax and semanticsof procol / R. van der Goot, A. de Bruin --Synthesizing distinguishing formulae for real time systems / J. Ch. Godskesen, K.G. Larsen -- From timed automata to logic andback / F. Laroussinie, K.G. Larsen, C. Weise -- Incremental model checking for decomposable structures / J.A. Makowsky, E.V. Ravve -- Automata for the modal [mu]-calculus and related results / D. Janin, I. Walukiewicz --A v-calculus with local views for systems of sequential agents / P. Niebert -- An operator calculus approach to the evolution of dynamic data structures / P. Feinsilver, R. Schott.
530 Also issued online.
650 0 Computer science^xMathematics^vCongresses.
700 1 Wiedermann, J.^q(Juraj)
700 1 Hแjek, Petr.
830 0 Lecture notes in computer science ;^v969.
945 ^p1^l0^i009296
999 ^aคณะวิศวะ (มมส)

คุณยังไม่ได้ล็อกอิน คุณสามารถมีกิจกรรมร่วมกับเว็บไซต์ได้ แต่ต้องล็อกอินก่อน ::

ล็อกอิน

ลำดับที่	ประเภท	เลขเรียก	สถานที่	สถานะ
1.		004 JC	หนังสือภาษาอังกฤษ	On Shelf ขอยืม
[แสดง 1/1 รายการ]