TCS 2002 - PDF Preprint Papers

TCS 2002 International Conference on Theoretical Computer Science

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed TCS-2002 Paper

click to vote

TCS
2002

156views Theoretical Computer Science» more TCS 2002»

Authentication tests and the structure of bundles

13 years 4 months ago

Download www.mitre.org

Suppose a principal in a cryptographic protocol creates and transmits a message containing a new value v, later receiving v back in a different cryptographic context. It can concl...

Joshua D. Guttman, F. Javier Thayer

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	156	Authentication tests and the structure of bundles	claim
2	155	Logical systems for structured specifications	claim
3	152	Binary (generalized) Post Correspondence Problem	claim
4	145	Process algebra for performance evaluation	claim
5	143	Relating CASL with other specification languages: the institution level	claim
6	135	Automatic verification of real-time systems with discrete probability distributions	claim
7	134	A formal approach to object-oriented software engineering	claim
8	128	Balance properties of multi-dimensional words	claim
9	114	Asymptotic behavior in a heap model with two pieces	claim
10	113	ELAN from a rewriting logic point of view	claim
11	109	A truly concurrent semantics for a process algebra using resource pomsets	claim
12	109	Unsupervised learning in neural computation	claim
13	109	Martin's game: a lower bound for the number of sets	claim
14	108	A coalgebraic equational approach to specifying observational structures	claim
15	105	Associative language descriptions	claim
16	105	The continuum as a final coalgebra	claim
17	105	Monadic second-order logic on tree-like structures	claim
18	100	Augmenting the discrete timed automaton with other data structures	claim
19	100	Words and forbidden factors	claim
20	99	A unified language processing methodology	claim
21	98	MAX3SAT is exponentially hard to approximate if NP has positive dimension	claim
22	97	Coding rotations on intervals	claim
23	97	A characterization of c.e. random reals	claim
24	96	Some permutation routing algorithms for low-dimensional hypercubes	claim
25	95	On canonical number systems	claim
26	95	A guide to membrane computing	claim
27	94	Complexity measures and decision tree complexity: a survey	claim
28	94	Counting H-colorings of partial k-trees	claim
29	94	Innocent game models of untyped lambda-calculus	claim
30	93	CASL: the Common Algebraic Specification Language	claim
31	93	Arrays, numeration systems and Frankenstein games	claim
32	92	Tilings as a programming exercise	claim
33	92	Strictness, totality, and non-standard-type inference	claim
34	90	Specification of real-time and hybrid systems in rewriting logic	claim
35	88	The chords' problem	claim
36	88	On the Yoneda completion of a quasi-metric space	claim
37	87	Canonical derivatives, partial derivatives and finite automaton constructions	claim
38	87	A comparison of two approaches to pseudorandomness	claim
39	86	Approximate algorithms for neural-Bayesian approaches	claim
40	84	Restriction categories I: categories of partial maps	claim
41	82	Topics in the theory of DNA computing	claim
42	81	Fixpoint semantics for logic programming a survey	claim
43	80	Operational and abstract semantics of the query language G-Log	claim
44	79	Threshold counters with increments and decrements	claim
45	79	On the robustness of interconnections in random graphs: a symbolic approach	claim
46	79	Simple and flexible detection of contiguous repeats using a suffix tree	claim
47	78	Measuring with jugs	claim
48	77	Notations for exponentiation	claim
49	77	Smaller solutions for the firing squad	claim
50	76	Presentations of computably enumerable reals	claim
51	73	Logical operations and Kolmogorov complexity	claim
52	70	Rounding Voronoi diagram	claim
53	70	Error-detecting properties of languages	claim
54	69	Set-sharing is redundant for pair-sharing	claim
55	69	Streams and strings in formal proofs	claim
56	69	Neural circuits for pattern recognition with small total wire length	claim
57	67	An example of a computable absolutely normal number	claim
58	63	Truly concurrent constraint programming	claim
59	60	Motif statistics	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers