HOME > 상세정보

상세정보

Automata, languages and programming : 22nd international colloquium, ICALP 95, Szeged, Hungary, July 10-14, 1995 : proceedings

Automata, languages and programming : 22nd international colloquium, ICALP 95, Szeged, Hungary, July 10-14, 1995 : proceedings

자료유형
단행본
개인저자
Fulop, Zoltan. Gecseg, F.
단체저자명
European Association for Theoretical Computer Science.
서명 / 저자사항
Automata, languages and programming : 22nd international colloquium, ICALP 95, Szeged, Hungary, July 10-14, 1995 : proceedings / Zoltan Fulop, Ferenc Gecseg (eds.).
발행사항
Berlin ;   New York :   Springer-Verlag ,   c1995.  
형태사항
xiii, 686 p. : ill. ; 24 cm.
총서사항
Lecture notes in computer science ; 944
ISBN
3540600841 (pbk. : alk. paper) 9783540600848 (pbk. : alk. paper)
일반주기
ICALP (International Colloquium on Automata, Languages, and Programming) is sponsored by the European Association for Theoretical Computer Science.  
서지주기
Includes bibliographical references and author index.
일반주제명
Machine theory -- Congresses. Formal languages -- Congresses. Computer programming -- Congresses.
000 01635camuu2200373 a 4500
001 000045561072
005 20091126135011
008 091123s1995 gw a b 101 0 eng d
020 ▼a 3540600841 (pbk. : alk. paper)
020 ▼a 9783540600848 (pbk. : alk. paper)
035 ▼a (OCoLC)ocm32966780
035 ▼a (OCoLC)32966780
040 ▼a RRR ▼c RRR ▼d UMC ▼d 211009
050 1 4 ▼a QA267 ▼b .I23 1995
082 0 0 ▼a 005.1 ▼2 22
090 ▼a 005.1 ▼b I613a ▼c 22
111 2 ▼a International Colloquium on Automata, Languages, and Programming ▼n (22nd : ▼d 1995 : ▼c Szeged, Hungary)
245 1 0 ▼a Automata, languages and programming : ▼b 22nd international colloquium, ICALP 95, Szeged, Hungary, July 10-14, 1995 : proceedings / ▼c Zoltan Fulop, Ferenc Gecseg (eds.).
246 3 0 ▼a ICALP 95
246 1 8 ▼a ICALP95
260 ▼a Berlin ; ▼a New York : ▼b Springer-Verlag , ▼c c1995.
300 ▼a xiii, 686 p. : ▼b ill. ; ▼c 24 cm.
490 1 ▼a Lecture notes in computer science ; ▼v 944
500 ▼a ICALP (International Colloquium on Automata, Languages, and Programming) is sponsored by the European Association for Theoretical Computer Science.
504 ▼a Includes bibliographical references and author index.
650 0 ▼a Machine theory ▼v Congresses.
650 0 ▼a Formal languages ▼v Congresses.
650 0 ▼a Computer programming ▼v Congresses.
700 1 ▼a Fulop, Zoltan.
700 1 ▼a Gecseg, F.
710 2 ▼a European Association for Theoretical Computer Science.
830 0 ▼a Lecture notes in computer science ; ▼v 944.
945 ▼a KINS

소장정보

No. 소장처 청구기호 등록번호 도서상태 반납예정일 예약 서비스
No. 1 소장처 과학도서관/Sci-Info(2층서고)/ 청구기호 005.1 I613a 22 등록번호 121186474 도서상태 대출가능 반납예정일 예약 서비스 B M

컨텐츠정보

목차

Theory of 2-structures.- A domain for concurrent termination a generalization of Mazurkiewicz traces.- Nonfinite axiomatizability of the equational theory of shuffle.- The algebraic equivalent of AFL theory.- Finite state transformations of images.- Post correspondence problem: Words possible as primitive solutions.- Computing the closure of sets of words under partial commutations.- Intervalizing k-colored graphs.- NC algorithms for finding a maximal set of paths with application to compressing strings.- On the construction of classes of suffix trees for square matrices: Algorithms and applications.- How to use the minimal separators of a graph for its chordal triangulation.- Fast gossiping by short messages.- Break Finite Automata Public Key Cryptosystem.- Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time.- On the number of random bits in totally private computation.- Lower time bounds for randomized computation.- New collapse consequences of NP having small circuits.- The complexity of searching succinctly represented graphs.- Optimal shooting: Characterizations and applications.- Placing resources in a tree: Dynamic and static algorithms.- Shortest path queries in digraphs of small treewidth.- A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs.- Parallel algorithms with optimal speedup for bounded treewidth.- Approximating minimum cuts under insertions.- Linear time algorithms for dominating pairs in asteroidal triple-free graphs.- On-line resource management with applications to routing and scheduling.- Alternation in simple devices.- Hybrid automata with finite bisimulations.- Generalized Sturmian languages.- Polynomial closure and unambiguous product.- Lower bounds on algebraic random access machines.- Improved deterministic PRAM simulation on the mesh.- On optimal polynomial time approximations: P-levelability vs. ?-levelability.- Weakly useful sequences.- Graph Connectivity, Monadic NP and built-in relations of moderate degree.- The expressive power of clocks.- Grammar systems: A grammatical approach to distribution and cooperation.- Compactness of systems of equations in semigroups.- Sensing versus nonsensing automata.- New upper bounds for generalized intersection searching problems.- OKFDDs versus OBDDs and OFDDs.- Bicriteria network design problems.- On determining optimal strategies in pursuit games in the plane.- Extension orderings.- The pushdown method to optimize chain logic programs.- Automatic synthesis of real time systems.- Self-correcting for function fields of finite transcendental degree.- Measure, category and learning theory.- A characterization of the existence of energies for neural networks.- Variable-length codes for error correction.- Graphbots: Mobility in discrete spaces.- Solving recursive net equations.- Implicit definability and infinitary logic in finite model theory.- The limit of splitn-language equivalence.- Divergence and fair testing.- Causality for mobile processes.- Internal mobility and agent-passing calculi.


정보제공 : Aladin

관련분야 신착자료

クジラ飛行机 (2022)