TCS 2011 - PDF Preprint Papers

TCS 2011 International Conference on Theoretical Computer Science

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed TCS-2011 Paper

click to vote

TCS
2011

70views Theoretical Computer Science» more TCS 2011»

Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern

1 years 9 days ago

Download www.dsi.unifi.it

We consider some Riordan arrays related to binary words avoiding a pattern p, which can be easily studied by means of an A-matrix rather than their A-sequence. Both concepts allow...

Donatella Merlini, Renzo Sprugnoli

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	70	Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern	claim
2	69	Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs	claim
3	68	Parameter estimation for Boolean models of biological networks	claim
4	67	Complexity of the traveling tournament problem	claim
5	60	The transposition median problem is NP-complete	claim
6	59	Optimization techniques for small matrix multiplication	claim
7	57	P systems with minimal insertion and deletion	claim
8	57	Communication complexity and intrinsic universality in cellular automata	claim
9	57	Smart PAC-learners	claim
10	56	Computing monodromy via continuation methods on random Riemann surfaces	claim
11	55	Last cases of Dejean's conjecture	claim
12	55	Dynamic normal forms and dynamic characteristic polynomial	claim
13	54	Strong normalization from an unusual point of view	claim
14	54	Minimal non-convex words	claim
15	53	Quasi-interpretations a way to control resources	claim
16	53	On the complex behavior of simple tag systems - An experimental approach	claim
17	52	Predicting the labels of an unknown graph via adaptive exploration	claim
18	52	An algorithmic framework for network reconstruction	claim
19	51	Aspects of predicative algebraic set theory, II: Realizability	claim
20	51	Combinatorics on words	claim
21	50	Computational processes, observers and Turing incompleteness	claim
22	50	Intuitionistic differential nets and lambda-calculus	claim
23	49	Correctness of linear logic proof structures is NL-complete	claim
24	48	Musings around the geometry of interaction, and coherence	claim
25	48	The three column Bandpass problem is solvable in linear time	claim
26	46	Local and global price of anarchy of graphical games	claim
27	45	Block insertion and deletion on trajectories	claim
28	45	Local 7-coloring for planar subgraphs of unit disk graphs	claim
29	45	A semantic measure of the execution time in linear logic	claim
30	44	Four states are enough!	claim
31	44	Highly concurrent multi-word synchronization	claim
32	44	Bitonic sorters of minimal depth	claim
33	43	Limitations of self-assembly at temperature 1	claim
34	43	Optimizing n-variate (n+k)-nomials for small k	claim
35	42	Realizability models and implicit complexity	claim
36	41	A linear algorithm for MLL proof net correctness and sequentialization	claim
37	41	Bounds for the generalized repetition threshold	claim
38	39	Pricing commodities	claim
39	39	Sorting and selection on dynamic data	claim
40	36	On the relationship between fuzzy and Boolean cellular automata	claim
41	36	Computational ludics	claim
42	28	Two faces of active learning	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers