STACS 2010 - PDF Preprint Papers

STACS 2010 Annual Symposium on Theoretical Aspects of Computer Science

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed STACS-2010 Paper

100

click to vote

STACS
2010
Springer

316views Theoretical Computer Science» more STACS 2010»

Mathematics, Cryptology, Security

14 years 6 months ago

Download drops.dagstuhl.de

Abstract. In this talk, I will review some of the work performed by the research community in cryptology and security since the invention of public key cryptography by Diﬃe and H...

Jacques Stern

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	316	Mathematics, Cryptology, Security	claim
2	254	Continuous Monitoring of Distributed Data Streams over a Time-based Sliding Window	claim
3	216	Two-phase Algorithms for the Parametric Shortest Path Problem	claim
4	214	AMS Without 4-Wise Independence on Product Domains	claim
5	209	Robust Fault Tolerant Uncapacitated Facility Location	claim
6	206	Optimal Query Complexity for Reconstructing Hypergraphs	claim
7	205	The Traveling Salesman Problem under Squared Euclidean Distances	claim
8	191	Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation	claim
9	185	Intrinsic Universality in Self-Assembly	claim
10	183	Planar Subgraph Isomorphism Revisited	claim
11	183	Evasiveness and the Distribution of Prime Numbers	claim
12	178	Construction Sequences and Certifying 3-Connectedness	claim
13	176	Dispersion in Unit Disks	claim
14	175	Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs	claim
15	174	A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem	claim
16	172	Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs	claim
17	172	Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs	claim
18	171	Named Models in Coalgebraic Hybrid Logic	claim
19	169	Unsatisfiable Linear CNF Formulas Are Large and Complex	claim
20	168	Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion	claim
21	168	The Complexity of Approximating Bounded-Degree Boolean #CSP	claim
22	167	Reflections on Multivariate Algorithmics and Problem Parameterization	claim
23	166	Relaxed Spanners for Directed Disk Graphs	claim
24	160	Log-space Algorithms for Paths and Matchings in k-trees	claim
25	158	Decidability of the Interval Temporal Logic ABB over the Natural Numbers	claim
26	157	Branching-time Model Checking of One-counter Processes	claim
27	156	Ultimate Traces of Cellular Automata	claim
28	156	Collapsible Pushdown Graphs of Level 2 are Tree-Automatic	claim
29	156	On Iterated Dominance, Matrix Elimination, and Matched Paths	claim
30	155	Evolving Multialgebras Unify All Usual Sequential Computation Models	claim
31	155	Large-Girth Roots of Graphs	claim
32	154	Long Non-crossing Configurations in the Plane	claim
33	152	Quantum Algorithms for Testing Properties of Distributions	claim
34	152	The Complexity of the List Homomorphism Problem for Graphs	claim
35	151	Improved Approximation Guarantees for Weighted Matching in the Semi-Streaming Model	claim
36	149	On Equations over Sets of Integers	claim
37	149	Holant Problems for Regular Graphs with Complex Edge Functions	claim
38	148	Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses	claim
39	147	The Tropical Double Description Method	claim
40	146	Exact Covers via Determinants	claim
41	145	The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets	claim
42	145	Alternation-Trading Proofs, Linear Programming, and Lower Bounds	claim
43	143	An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem	claim
44	140	Computing Least Fixed Points of Probabilistic Systems of Polynomials	claim
45	139	Sponsored Search, Market Equilibria, and the Hungarian Method	claim
46	138	Revisiting the Rice Theorem of Cellular Automata	claim
47	136	The Recognition of Tolerance and Bounded Tolerance Graphs	claim
48	133	Online Correlation Clustering	claim
49	132	The k-in-a-path Problem for Claw-free Graphs	claim
50	130	Inseparability and Strong Hypotheses for Disjoint NP Pairs	claim
51	124	Finding Induced Subgraphs via Minimal Triangulations	claim
52	124	Treewidth Reduction for Constrained Separation and Bipartization Problems	claim
53	114	On Optimal Heuristic Randomized Semidecision Procedures, with Application to Proof Complexity	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers