LATIN 2010 - PDF Preprint Papers

LATIN 2010 Latin American Symposium on Theoretical Informatics

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed LATIN-2010 Paper

click to vote

LATIN
2010
Springer

138views Information Technology» more LATIN 2010»

Pairs of Complementary Unary Languages with "Balanced" Nondeterministic Automata

1 years 10 months ago

Download pighizzini.dico.unimi.it

Viliam Geffert, Giovanni Pighizzini

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.

Related Conferences

Id	Views	Title	Status
1	138	Pairs of Complementary Unary Languages with "Balanced" Nondeterministic Automata	claim
2	138	Minimum-Perimeter Intersecting Polygons	claim
3	137	Compact Rich-Functional Binary Relation Representations	claim
4	101	Rank Selection in Multidimensional Data	claim
5	97	The I/O Complexity of Sparse Matrix Dense Matrix Multiplication	claim
6	95	Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs	claim
7	88	Lipschitz Unimodal and Isotonic Regression on Paths and Trees	claim
8	83	Kernelization through Tidying	claim
9	82	The Complexity of Counting Eulerian Tours in 4-Regular Graphs	claim
10	82	Optimal Succinctness for Range Minimum Queries	claim
11	79	Visiting a Sequence of Points with a Bevel-Tip Needle	claim
12	78	Colorful Strips	claim
13	78	Some Observations on Holographic Algorithms	claim
14	77	Layered Working-Set Trees	claim
15	77	Optimal Polygonal Representation of Planar Graphs	claim
16	75	Faithful Representations of Graphs by Islands in the Extended Grid	claim
17	74	Sharp Separation and Applications to Exact and Parameterized Algorithms	claim
18	73	The Language Theory of Bounded Context-Switching	claim
19	72	Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials	claim
20	71	Modelling the LLL Algorithm by Sandpiles	claim
21	71	Matching Points with Things	claim
22	70	Prize-Collecting Steiner Networks via Iterative Rounding	claim
23	70	Average Parameterization and Partial Kernelization for Computing Medians	claim
24	69	The Power of Fair Pricing Mechanisms	claim
25	69	Tilings Robust to Errors	claim
26	69	Sparse Recovery Using Sparse Random Matrices	claim
27	68	Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight	claim
28	68	Finding the Smallest Gap between Sums of Square Roots	claim
29	66	Radix Cross-Sections for Length Morphisms	claim
30	66	Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization	claim
31	64	Euclidean Prize-Collecting Steiner Forest	claim
32	64	The Size and Depth of Layered Boolean Circuits	claim
33	63	Complexity of Operations on Cofinite Languages	claim
34	61	On Quadratic Threshold CSPs	claim
35	59	Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines	claim
36	58	Packet Routing on the Grid	claim
37	51	Lightweight Data Indexing and Compression in External Memory	claim
38	49	The Interval Constrained 3-Coloring Problem	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers