The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "Theor. Comput. Sci."( http://dblp.L3S.de/Venues/Theor._Comput._Sci. )

URL (DBLP): http://dblp.uni-trier.de/db/journals/tcs

Publication years (Num. hits)
1975-1976 (74) 1977 (41) 1978 (36) 1979 (48) 1980 (67) 1981 (82) 1982 (94) 1983 (109) 1984 (124) 1985 (152) 1986 (127) 1987 (108) 1988 (118) 1989 (131) 1990 (141) 1991 (251) 1992 (245) 1993 (239) 1994 (280) 1995 (227) 1996 (278) 1997 (283) 1998 (266) 1999 (253) 2000 (317) 2001 (378) 2002 (397) 2003 (570) 2004 (446) 2005 (440) 2006 (468) 2007 (436) 2008 (464) 2009 (477) 2010 (330) 2011 (567) 2012 (469) 2013 (446) 2014 (443) 2015 (520) 2016 (464) 2017 (380) 2018 (352) 2019 (331)
Publication types (Num. hits)
article(12469)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 12469 publication records. Showing 12469 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Shantanu Das 0001, Riccardo Focardi, Flaminia L. Luccio, Euripides Markou, Marco Squarcina Gathering of robots in a ring with mobile faults. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sylvain Lazard, William J. Lenhart, Giuseppe Liotta On the edge-length ratio of outerplanar graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jiapeng Huang, Zhenzao Wen, Linghe Kong, Li Ge, Min-You Wu, Guihai Chen Accelerate the classification statistics in RFID systems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Navin Goyal, Manoj Gupta 0002 Better analysis of greedy binary search tree on decomposable sequences. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Patrick Spettel, Hans-Georg Beyer Analysis of the (1, λ)-σ-Self-Adaptation Evolution Strategy with repair by projection applied to a conically constrained problem. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Bireswar Das, Murali Krishna Enduri, Masashi Kiyomi, Neeldhara Misra, Yota Otachi, I. Vinod Reddy, Shunya Yoshimura On structural parameterizations of firefighting. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Lukasz Merta Composition inverses of the variations of the Baum-Sweet sequence. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sungwook Kim, Jinsu Kim, Jae Hong Seo A new approach to practical function-private inner product encryption. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Zhenhua Duan, Cong Tian, Nan Zhang 0001, Qian Ma, Hongwei Du Index set expressions can represent temporal logic formulas. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Oscar H. Ibarra, Ian McQuillan, Bala Ravikumar On counting functions and slenderness of languages. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Georgios Konstantinidis, Athanasios Kehagias Selfish cops and active robber: Multi-player pursuit evasion on graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jia Guo, Desai Li, Mei Lu The g-good-neighbor conditional diagnosability of the crossed cubes under the PMC and MM* model. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Longkun Guo, Min Li, Dachuan Xu Efficient approximation algorithms for maximum coverage with group budget constraints. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Carlos Lombardi, Alejandro Ríos, Roel de Vrijer Projections for infinitary rewriting (extended version). Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yuan Li, John O. Adeyeye Maximal sensitivity of Boolean nested canalizing functions. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jeremy F. Alm, Andrew Ylvisaker A fast coset-translation algorithm for computing the cycle structure of Comer relation algebras over Z/pZ. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Xiaofeng Gao, Dongdong Ge Preface: Special Issue on the Annual International Conference on Combinatorial Optimization and Applications (COCOA). Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jörg Endrullis, Jan Willem Klop Braids via term rewriting. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Manfred Droste, Sven Dziadek, Werner Kuich Weighted simple reset pushdown automata. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Lila Kari Editorial. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Khaled M. Elbassioni, Imran Rauf, Saurabh Ray A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Akinori Kawachi, Mitsunori Ogihara, Kei Uchizawa Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Thierry Coquand Canonicity and normalization for dependent type theory. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Pedro Ribeiro 0002, Ana Cavalcanti Angelic processes for CSP via the UTP. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Dekel Tsur Faster deterministic parameterized algorithm for k-Path. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Michael Wallner A bijection of plane increasing trees with relaxed binary trees of right height at most one. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ahmad Mahmoody, Eli Upfal Optimizing static and adaptive probing schedules for rapid event detection. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Marjorie Bournat, Ajoy K. Datta, Swan Dubois Self-stabilizing robots in highly dynamic environments. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yeganeh Bahoo, Stephane Durocher, J. Mark Keil, Debajyoti Mondal, Saeed Mehrabi 0001, Sahar Mehrpour Polygon simplification by minimizing convex corners. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Michal Hospodár, Galina Jirásková, Peter Mlynárcik Nondeterministic complexity in subclasses of convex languages. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Petr A. Golovach, Dieter Kratsch, Mohamed Yosri Sayadi Enumeration of maximal irredundant sets for claw-free graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yiannis Giannakopoulos, Elias Koutsoupias, Maria Kyropoulou The anarchy of scheduling without money. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Louis-Marie Dando, Sylvain Lombardy From Hadamard expressions to weighted rotating automata and back. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Stephane Durocher, Robby Singh A simple linear-space data structure for constant-time range minimum query. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jérôme Feret, Loïc Paulevé, David Safránek Preface. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Tingfang Wu, Linqiang Pan, Artiom Alhazov Computation power of asynchronous spiking neural P systems with polarizations. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Irena Rusu Min (a)cyclic feedback vertex sets and min ones monotone 3-SAT. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack Weighted minimum backward Fréchet distance. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Birzhan Moldagaliyev Randomness of formal languages via automatic martingales. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Cosimo Vinci Non-atomic one-round walks in congestion games. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Andrew Ryzhikov Synchronization problems in automata without non-trivial cycles. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jan Arne Telle, Yngve Villanger FPT algorithms for domination in sparse graphs and beyond. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Krishnamoorthy Dinesh 0001, Jayalal Sarma Alternation, sparsity and sensitivity: Bounds and exponential gaps. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fumiya Okubo, Takashi Yokomori Decomposition and factorization of chemical reaction transducers. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1San Ling, Khoa Nguyen, Huaxiong Wang, Yanhong Xu Lattice-based group signatures: Achieving full dynamicity (and deniability) with ease. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yeganeh Bahoo, Bahareh Banyassady, Prosenjit K. Bose, Stephane Durocher, Wolfgang Mulzer A time-space trade-off for computing the k-visibility region of a point in a polygon. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Pratik Ghosal, Meghana Nasre, Prajakta Nimbhorkar Rank-maximal matchings - structure and algorithms. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Benjamin Bergougnoux, Mamadou Moustapha Kanté Fast exact algorithms for some connectivity problems parameterized by clique-width. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ajoy K. Datta, Stéphane Devismes, Lawrence L. Larmore A silent self-stabilizing algorithm for the generalized minimal k-dominating set problem. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Dimitris Fotakis, Aris Pagourtzis, Vangelis Th. Paschos Preface to Special Issue on Algorithms and Complexity. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Rostam Sabeti Polynomial expressions for non-binomial structures. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Motoya Machida, Alexander Y. Shibakov Stack and register complexity of radix conversions. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1C. R. Noordman, Gerard A. W. Vreeswijk Evolving novelty strategies for the Iterated Prisoner's Dilemma in deceptive tournaments. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Svyatoslav Covanov Improved method for finding optimal formulas for bilinear maps in a finite field. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Pieter Kleer, Guido Schäfer Tight inefficiency bounds for perception-parameterized affine congestion games. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fei Huang, Xueliang Li 0001, Zhongmei Qin, Colton Magnant Minimum degree condition for proper connection number 2. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sanjib Sadhu, Sasanka Roy, Subhas C. Nandy, Suchismita Roy Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Júlio Araújo, Cláudia Linhares Sales, Ignasi Sau, Ana Silva Weighted proper orientations of trees and graphs of bounded treewidth. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yoshifumi Sakai A substring-substring LCS data structure. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Miroslaw Kowaluk, Andrzej Lingas A fast deterministic detection of small pattern graphs in graphs without large cliques. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Cristina Bazgan, Thomas Pontoizeau, Zsolt Tuza Finding a potential community in networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yang Jiao, R. Ravi 0001, Wolfgang Gatterbauer Algorithms for automatic ranking of participants and tasks in an anonymized contest. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yi Xu, Jigen Peng, Yinfeng Xu, Binhai Zhu The discrete and mixed minimax 2-center problems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Kelin Luo, Yinfeng Xu, Huili Zhang On-line scheduling with monotone subsequence constraints. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Chao Xu 0010, Jianer Chen, Jianxin Wang Resolution and linear CNF formulas: Improved (n, 3)-MaxSAT algorithms. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Boaz Farbstein, Asaf Levin Deadline TSP. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Stefan Gerdjikov, Stoyan Mihov, Klaus U. Schulz Space-efficient bimachine construction based on the equalizer accumulation principle. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ricardo Honorato-Zimmer, Andrew J. Millar, Gordon D. Plotkin, Argyris Zardilis Chromar, a language of parameterised agents. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Adi Shraibman Nondeterministic communication complexity with help and graph functions. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Liang Zhao, Xiaobing Wang, Zhenhua Duan Model checking of pushdown systems for projection temporal logic. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Gaoxing Sun, Shuang Zhao, Jixiang Meng Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Lavindra de Silva, Lin Padgham, Sebastian Sardiña HTN-like solutions for classical planning problems: An application to BDI agent systems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jie Xue, Huiqiu Lin, Jinlong Shu The algebraic connectivity of graphs with given circumference. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Mohan Chris Monica, Samivel Santhakumar, Micheal Arockiaraj, Jia-Bao Liu Partition dimension of certain classes of series parallel graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jianer Chen, Henning Fernau, Peter Shaw 0001, Jianxin Wang, Zhibiao Yang Kernels for packing and covering problems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Benjamin Doerr Analyzing randomized search heuristics via stochastic domination. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Md. Ariful Islam, Rance Cleaveland, Flavio H. Fenton, Radu Grosu, Paul L. Jones, Scott A. Smolka Probabilistic reachability for multi-parameter bifurcation analysis of cardiac alternans. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yuzhi Xiao, Haixing Zhao, Yaping Mao, Guanrong Chen Invulnerability of planar two-tree networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Karl Bringmann, Ralph Keusch, Johannes Lengler Geometric inhomogeneous random graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Wenjun Li, Haiyan Liu, Jianxin Wang, Lingyun Xiang, Yongjie Yang An improved linear kernel for complementary maximal strip recovery: Simpler and smaller. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Manon Stipulanti Convergence of Pascal-like triangles in Parry-Bertrand numeration systems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Khin Mi Mi Aung, Hyung Tae Lee, Benjamin Hong Meng Tan, Huaxiong Wang Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Behrooz Alizadeh, Esmaeil Afrashteh, Fahimeh Baroughi Bonab Inverse obnoxious p-median location problems on trees with edge length modifications under different norms. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Naoki Kobayashi 0001 Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sanjay Jain 0001, Efim B. Kinber Intrinsic complexity of partial learning. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Kai Zhang 0016, Jie Chen 0021, Hyung Tae Lee, Haifeng Qian, Huaxiong Wang Efficient public key encryption with equality test in the standard model. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Pierluigi Baiocchi, Tiziana Calamoneri, Angelo Monti, Rossella Petreschi Some classes of graphs that are not PCGs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Benoît Libert, San Ling, Fabrice Mouhartem, Khoa Nguyen, Huaxiong Wang Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Mário S. Alvim, Konstantinos Chatzikokolakis 0001, Annabelle McIver, Carroll Morgan, Catuscia Palamidessi, Geoffrey Smith An axiomatization of information flow measures. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno Active influence spreading in social networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Can Umut Ileri, Orhan Dagdeviren A self-stabilizing algorithm for b-matching. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Mamadou Moustapha Kanté, Thiago Braga Marcilon, Rudini M. Sampaio On the parameterized complexity of the geodesic hull number. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yanwei Zhou, Bo Yang 0003, Yi Mu 0001 The generic construction of continuous leakage-resilient identity-based cryptosystems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Marieh Jahannia, Morteza Mohammad Noori, Narad Rampersad, Manon Stipulanti Palindromic Ziv-Lempel and Crochemore factorizations of m-bonacci infinite words. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Arnaud Casteigts, Yves Métivier, J. M. Robson, Akka Zemmari Counting in one-hop beeping networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Francesco Dolce, Antonio Restivo, Christophe Reutenauer On generalized Lyndon words. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Nicholas R. Beaton, Mathilde Bouvel, Veronica Guerrini, Simone Rinaldi Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Pierre Bonardo, Anna E. Frid, Jeffrey Shallit The number of valid factorizations of Fibonacci prefixes. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sayan Bhattacharya, Monika Henzinger, Stefan Neumann 0003 New amortized cell-probe lower bounds for dynamic problems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Tomohiro I, Dominik Köppl Improved upper bounds on all maximal α-gapped repeats and palindromes. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 12469 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license