The following pages link to Theoretical Computer Science (Q123643):
Displaying 50 items.
- Australasian computer science (Q1586193) (← links)
- Modern algebra and its applications. Selected papers from the Computer Science sessions. International conference, Vanderbilt Univ., Nashville, TN, USA, May 1996 (Q1586194) (← links)
- Combinatorial algorithms. 9th Australasian workshop, AWOCA '98, Curtin Univ. of Technology in Perth, Western Australia, July 27--30, 1998 (Q1586195) (← links)
- Partial evaluation and semantics-based program manipulation. Selected papers of the ACM SIGPLAN symposium, PEPM'97, Amsterdam, Netherlands, Juni 12--13, 1997 (Q1586196) (← links)
- Semigroups and algebraic engineering. 1st international conference, Univ. of Aizu, Japan, March 24--28, 1997. Dedicated to John L. Rhodes on his 60th birthday (Q1586197) (← links)
- Algorithms for future technologies. Papers of the workshop ALTEC-KIT, Saarbrücken, Germany, May 23--26, 1997 (Q1586198) (← links)
- Proof-search in type-theoretic languages (Q1586199) (← links)
- Implementing automata. Selected papers from the 2nd international workshop, WIA '97, Univ. of Western Ontario, London, Ontario, Canada, September 18--20, 1997 (Q1586200) (← links)
- Universal machines and computers. 2nd international colloquium, MCU '98, Metz, France, March 23--27, 1998 (Q1586201) (← links)
- Mathematical foundations of programming semantics. Proceedings of the 11th conference, MFPS XI, dedicated to John C. Reynolds on the occasion of his 60th birthday, Tulane Univ., New Orleans, LA, USA, March 29 - April 1, 1995 (Q1586202) (← links)
- Linear logic I. The Linear Logic 96 Tokyo Meeting, Mita Campus of Keio Univ., Tokyo, Japan, March 28 -- April 2, 1996 (Q1586203) (← links)
- Cryptography. Special issue is dedicated to Prof. Arto Salomaa on occasion of his 65th birthday (Q1586204) (← links)
- Enumerating all connected maximal common subgraphs in two graphs (Q1589412) (← links)
- Shuffle languages are in P (Q1589415) (← links)
- Homomorphic characterizations of recursively enumerable languages with very small language classes (Q1589418) (← links)
- How to decide continuity of rational functions on infinite words (Q1589419) (← links)
- A predicative and decidable characterization of the polynomial classes of languages (Q1589422) (← links)
- Structural properties of bounded relations with an application to NP optimization problems (Q1589424) (← links)
- A practical algorithm for making filled graphs minimal (Q1589427) (← links)
- Extended capabilities for visual cryptography (Q1589430) (← links)
- Language-theoretic aspects of DNA complementarity (Q1589432) (← links)
- Generalized submodular cover problems and applications (Q1589434) (← links)
- Semi-dynamic breadth-first search in digraphs (Q1589436) (← links)
- Restricted ground tree transducers (Q1589437) (← links)
- Double Greibach operator grammars (Q1589438) (← links)
- Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval (Q1589441) (← links)
- Re-describing an algorithm by Hopcroft (Q1589443) (← links)
- Automatic semigroups (Q1589444) (← links)
- \(L(A)=L(B)\)? decidability results from complete formal systems (Q1589483) (← links)
- A new heap game (Q1589501) (← links)
- Infinite cyclic impartial games (Q1589503) (← links)
- Extended thermography for multiple \(kos\) in Go (Q1589505) (← links)
- Applying adversarial planning techniques to Go (Q1589506) (← links)
- Strategies anticipating a difference in search depth using opponent-model search (Q1589507) (← links)
- Temporal difference learning applied to game playing and the results of application to Shogi (Q1589508) (← links)
- A solution to the GHI problem for best-first search (Q1589511) (← links)
- Sokoban: Improving the search with relevance cuts (Q1589512) (← links)
- Multi-cut \(\alpha \beta\)-pruning in game-tree search (Q1589514) (← links)
- Game tree algorithms and solution trees (Q1589517) (← links)
- A theoretical and empirical investigation of search in imperfect information games (Q1589518) (← links)
- Refinement of time (Q1589580) (← links)
- Deductive verification of real-time systems using STeP (Q1589585) (← links)
- PLC-automata: A new class of implementable real-time automata (Q1589587) (← links)
- The Verus language: Representing time efficiently with BDDs (Q1589589) (← links)
- Verification, refinement and scheduling of real-time programs (Q1589590) (← links)
- Names of the \(\pi\)-calculus agents handled locally (Q1589648) (← links)
- Proof nets, garbage, and computations (Q1589650) (← links)
- \(\pi\)-calculus in (Co)inductive-type theory (Q1589654) (← links)
- Measure and probability for concurrency theorists (Q1589655) (← links)
- Asynchronous process calculi: The first- and higher-order paradigms (Q1589656) (← links)
