Theoretical Computer Science

Edit Your Profile

Theoretical Computer Science Journal

publication venue for

A generalization of a theorem of Rothschild and van Lint. 955. 2023
Finding optimal non-datapath caching strategies via network flow. 945. 2023
A new coding-based algorithm for finding closest pair of vectors. 782:129-144. 2019
An axiomatization of information flow measures. 777:32-54. 2019
Synthesis and infeasibility analysis for stochastic models of biochemical systems using statistical model checking and abstraction refinement. 412:2162-2187. 2011
A NOTE ON THE COMBINATORIAL STRUCTURE OF THE VISIBILITY GRAPH IN SIMPLE POLYGONS. 140:249-263. 1995
AN OPTIMAL DISTRIBUTED ALGORITHM FOR RECOGNIZING MESH-CONNECTED NETWORKS. 120:261-278. 1993
AN AVERAGE-CASE ANALYSIS OF MAT AND INVERTED FILE. 62:251-266. 1988
AN ASYMPTOTIC EQUALITY FOR THE NUMBER OF NECKLACES IN A SHUFFLE-EXCHANGE NETWORK 1992
PREFACE TO THE SPECIAL ISSUE ON GEOMETRICAL ALGORITHMS - DEDICATED TO PROFESSOR SAOUDI,A 1995

International Standard Serial Number (ISSN)

0304-3975

Electronic International Standard Serial Number (EISSN)

1879-2294