Lecture Notes in Computer Science - FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540206804, 9783540245971

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Axioms for Regular Words

Lecture Notes in Computer Science - FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science ◽

10.1007/978-3-540-24597-1_5 ◽

2003 ◽

pp. 50-61

Author(s):

Stephen L. Bloom ◽

Zoltán Ésik

Get full-text (via PubEx)

Zigzag Products, Expander Constructions, Connections, and Applications

Lecture Notes in Computer Science - FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science ◽

10.1007/978-3-540-24597-1_38 ◽

2003 ◽

pp. 443-443

Author(s):

Avi Wigderson

Get full-text (via PubEx)

A Separation Logic for Resource Distribution

Lecture Notes in Computer Science - FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science ◽

10.1007/978-3-540-24597-1_3 ◽

2003 ◽

pp. 23-37 ◽

Cited By ~ 5

Author(s):

Nicolas Biri ◽

Didier Galmiche

Keyword(s):

Resource Distribution ◽

Separation Logic

Get full-text (via PubEx)

The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata

Lecture Notes in Computer Science - FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science ◽

10.1007/978-3-540-24597-1_10 ◽

2003 ◽

pp. 112-123 ◽

Cited By ~ 43

Author(s):

Arnaud Carayol ◽

Stefan Wöhrle

Keyword(s):

Higher Order ◽

Infinite Graphs ◽

Pushdown Automata

Get full-text (via PubEx)

A Cryptographically Sound Security Proof of the Needham-Schroeder-Lowe Public-Key Protocol

Lecture Notes in Computer Science - FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science ◽

10.1007/978-3-540-24597-1_1 ◽

2003 ◽

pp. 1-12 ◽

Cited By ~ 19

Author(s):

Michael Backes ◽

Birgit Pfitzmann

Keyword(s):

Public Key ◽

Security Proof

Get full-text (via PubEx)

Comparing Sequences with Segment Rearrangements

Lecture Notes in Computer Science - FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science ◽

10.1007/978-3-540-24597-1_16 ◽

2003 ◽

pp. 183-194 ◽

Cited By ~ 15

Author(s):

Funda Ergun ◽

S. Muthukrishnan ◽

S. Cenk Sahinalp

Get full-text (via PubEx)

Efficient Algorithms for Abelian Group Isomorphism and Related Problems

Lecture Notes in Computer Science - FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science ◽

10.1007/978-3-540-24597-1_24 ◽

2003 ◽

pp. 277-288 ◽

Cited By ~ 2

Author(s):

T. Kavitha

Keyword(s):

Abelian Group ◽

Efficient Algorithms ◽

Group Isomorphism

Get full-text (via PubEx)

Constructions of Sparse Asymmetric Connectors

Lecture Notes in Computer Science - FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science ◽

10.1007/978-3-540-24597-1_2 ◽

2003 ◽

pp. 13-22 ◽

Cited By ~ 3

Author(s):

Andreas Baltz ◽

Gerold Jäger ◽

Anand Srivastav

Get full-text (via PubEx)

An Equational Theory for Transactions

Lecture Notes in Computer Science - FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science ◽

10.1007/978-3-540-24597-1_4 ◽

2003 ◽

pp. 38-49 ◽

Cited By ~ 12

Author(s):

Andrew P. Black ◽

Vincent Cremet ◽

Rachid Guerraoui ◽

Martin Odersky

Keyword(s):

Equational Theory

Get full-text (via PubEx)

Subtyping Constraints in Quasi-lattices

Lecture Notes in Computer Science - FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science ◽

10.1007/978-3-540-24597-1_12 ◽

2003 ◽

pp. 136-148 ◽

Cited By ~ 3

Author(s):

Emmanuel Coquery ◽

François Fages

Get full-text (via PubEx)

Lecture Notes in Computer Science - FST TCS 2003: Foundations of Software Technology and Theoretical Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Axioms for Regular Words

Zigzag Products, Expander Constructions, Connections, and Applications

A Separation Logic for Resource Distribution

The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata

A Cryptographically Sound Security Proof of the Needham-Schroeder-Lowe Public-Key Protocol

Comparing Sequences with Segment Rearrangements

Efficient Algorithms for Abelian Group Isomorphism and Related Problems

Constructions of Sparse Asymmetric Connectors

An Equational Theory for Transactions

Subtyping Constraints in Quasi-lattices

Lecture Notes in Computer Science - FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Latest Publications