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 (85)
Publication types (Num. hits)
article(12223)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 12223 publication records. Showing 12223 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Bruno Escoffier Saving colors and Max Coloring: Some fixed-parameter tractability results. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yair Bartal, Lee-Ad Gottlieb Approximate nearest neighbor search for ℓp-spaces (2 Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Qingyu He, Luoshan Xu Weak algebraic information systems and a new equivalent category of DOM of domains. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Leslie Ann Goldberg, John Lapinskas, Johannes Lengler, Florian Meier, Konstantinos Panagiotou, Pascal Pfister Asymptotically optimal amplifiers for the Moran process. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Vittorio Bilò, Antonio Caruso 0001 Editorial. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Albert Guan, Wen-Guey Tzeng A light-weight bit commitment protocol based on unpredictable channel noise. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Rodrigo Ferreira da Silva, Sebastián Urrutia, Vinícius Fernandes dos Santos One-Sided Weak Dominance Drawing. 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
1Majid Khonji, Areg Karapetyan, Khaled M. Elbassioni, Sid Chi-Kin Chau Complex-demand scheduling problem with application in smart grid. 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
1Shimin Li, Haitao Wang 0001 Algorithms for covering multiple barriers. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Zhao Wang, Yaping Mao, Eddie Cheng, Jinyu Zou Matching preclusion number of graphs. 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
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
1Tiziana Calamoneri, Matteo Dell'Orefice, Angelo Monti A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs. 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
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
1Bojan Marinkovic, Paola Glavan, Zoran Ognjanovic Proving properties of the Chord protocol using the ASM formalism. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yongjie Yang, Yash Raj Shrestha, Jiong Guo On the complexity of bribery with distance restrictions. 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
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
1Qiang Zhu 0003, Lili Li, Sanyang Liu, Xing Zhang Hybrid fault diagnosis capability analysis of hypercubes under the PMC model and MM⁎ model. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Xiang-Jun Li, Min Liu, Zheng Yan, Jun-Ming Xu On conditional fault tolerance of hierarchical cubic networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fidaa Abed, Lin Chen 0009, Yann Disser, Martin Groß 0001, Nicole Megow, Julie Meißner, Alexander T. Richter, Roman Rischke Scheduling maintenance jobs in networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Rui-Juan Jing, Chun-Ming Yuan, Xiao-Shan Gao A polynomial-time algorithm to compute generalized Hermite normal forms of matrices over Z[x]. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Arne Leitert, Feodor F. Dragan Parameterized approximation algorithms for some location problems in graphs. 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
1Marco Bernardo 0001, Marino Miculan Constructive logical characterizations of bisimilarity for reactive probabilistic systems. 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
1Gianlorenzo D'Angelo, Lorenzo Severini, Yllka Velaj Recommending links through influence maximization. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Dimitri Lajou On the achromatic number of signed graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Andrew Ryzhikov On automata recognizing birecurrent sets. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Christophe Crespelle Fully dynamic representations of interval graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Olivier Hudry, Antoine Lobstein Unique (optimal) solutions: Complexity results for identifying and locating-dominating codes. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Zhao Wang, Christopher Melekian, Eddie Cheng, Yaping Mao Matching preclusion number in product graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jirí Adámek, Stefan Milius On functors preserving coproducts and algebras with iterativity. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Peng Jiang, Fuchun Guo, Yi Mu 0001 Efficient identity-based broadcast encryption with keyword search against insider attacks for database systems. 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
1Zhen Zhang, Shuqiang Huang, Dong Guo, Yonghui Li 0001 RVCCC: A new variational network of cube-connected cycles and its topological properties. 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
1Barry Jay Intensional computation with higher-order functions. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yi-Jun Chang Hardness of RNA folding problem with four symbols. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Atsushi Takayasu, Noboru Kunihiro Partial key exposure attacks on RSA: Achieving the Boneh-Durfee bound. 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
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
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
1Qian-Ping Gu, Gengchun Xu Constant query time (1 + ϵ)-approximate distance oracle for planar graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Antonio Faonio, Jesper Buus Nielsen, Mark Simkin, Daniele Venturi 0001 Continuously non-malleable codes with split-state refresh. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Mehdi Vatandoost, Ali Akbar Estaji, Rahimeh Pourkhandani A generalized modal logic in causal structures. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yuxing Yang, Jing Li, Shiying Wang Embedding fault-free hamiltonian paths with prescribed linear forests into faulty ternary n-cubes. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yuval Emek, Yaacov Shapiro, Yuyi Wang Minimum cost perfect matching with delays for two sources. 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
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
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
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
1Rafic Nader, Alain Bretto, Bassam Mourad, Hassan Abbas On the positive semi-definite property of similarity matrices. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Huazhong Lü, Fan Wang Hamiltonian paths passing through prescribed edges in balanced hypercubes. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Eddie Cheng, Ke Qiu, Zhizhang Shen A general approach to deriving the g-good-neighbor conditional diagnosability of interconnection networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Petr Cintula, Denisa Diaconescu, George Metcalfe Skolemization and Herbrand theorems for lattice-valued logics. 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
1Yulong Wei, Min Xu 0005 Hybrid fault diagnosis capability analysis of regular graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Wen An Liu, Tao Wu Multi-player End-Nim games. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Shirin Baghoolizadeh, Ali Movaghar, Negin Majidi A uniformization-based algorithm for continuous-time stochastic games model checking. 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
1Gonzalo Navarro, Nicola Prezza Universal compressed text indexing. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Laurent Gourvès, Jérôme Monnot On maximin share allocations in matroids. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Lutz Straßburger On the decision problem for MELL. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Mengjie Lv, Shuming Zhou, Xueli Sun, Guanqin Lian, Jiafei Liu Reliability of (n, k)-star network based on g-extra conditional fault. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Kun He 0011, Qian Li, Xiaoming Sun A tighter relation between sensitivity complexity and certificate complexity. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sascha Brauer Complexity of single-swap heuristics for metric facility location and related problems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jacob M. Howe, Andy King, Axel Simon Incremental Closure for Systems of Two Variables Per Inequality. 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
1Chiara Bodei, Linda Brodo, Roberto Bruni A formal approach to open multiparty interactions. 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
1Manuel Lafond, Nadia El-Mabrouk, Katharina T. Huber, Vincent Moulton The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1György Dósa, Hans Kellerer, Zsolt Tuza Restricted assignment scheduling with resource constraints. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Evangelos Bampas, Lélia Blin, Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, Maria Potop-Butucaru, Sébastien Tixeuil On asynchronous rendezvous in general graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jianye Huang, Qiong Huang, Willy Susilo Leakage-resilient ring signature schemes. 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
1Giuseppe Antonio Di Luna, Paola Flocchini, Taisuke Izumi, Tomoko Izumi, Nicola Santoro, Giovanni Viglietta Population protocols with faulty interactions: The impact of a leader. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Petr Kucera, Petr Savický, Vojtech Vorel A lower bound on CNF encodings of the at-most-one constraint. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Robin Hirsch, Marcel Jackson, Tomasz Kowalski Algebraic foundations for qualitative calculi and networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Silvia Bonomi, Antonella Del Pozzo, Maria Potop-Butucaru, Sébastien Tixeuil Approximate Agreement under Mobile Byzantine Faults. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Torben Hagerup, Frank Kammer, Moritz Laudahn Space-efficient Euler partition and bipartite edge coloring. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak, Marcin Witkowski Distributed CONGESTBC constant approximation of MDS in bounded genus graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Walter Guttmann An algebraic framework for minimum spanning tree problems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Litao Guo Reliability analysis of twisted cubes. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Sergey Bereg, Binay Bhattacharya, Sandip Das 0001, Tsunehiko Kameda, Priya Ranjan Sinha Mahapatra, Zhao Song Optimizing squares covering a set of points. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Marzio De Biasi, Tim Ophelders The complexity of snake and undirected NCL variants. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Emanuele Di Buccio Utilizing sources of evidence in relevance feedback through geometry. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jirí Síma, Petr Savický Quasi-periodic β-expansions and cut languages. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Qilong Feng, Neng Huang, Xiong Jiang, Jianxin Wang Dealing with several parameterized problems by random methods. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Diederik Aerts, Jonito Aerts Arguëlles, Lester Beltran, Lyneth Beltran, Isaac Distrito, Massimiliano Sassoli de Bianchi, Sandro Sozzo, Tomas Veloz Towards a quantum World Wide Web. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Lili Mei, Deshi Ye, Guochuan Zhang Mechanism design for one-facility location game with obnoxious effects on a line. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Keren Censor-Hillel, Tariq Toukan On fast and robust information spreading in the Vertex-Congest model. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Christian Choffrut, Zoltán Ésik Two equational theories of partial words. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Robert Bredereck, Jiehua Chen, Falk Hüffner, Stefan Kratsch Parameterized complexity of team formation in social networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jie-Meng Zhang, Yingjun Guo, Zhi-Xiong Wen On the regularity of {⌊logb(αn+ β)⌋}n ≥0. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Vladimir I. Danilov, Ariane Lambert-Mogiliansky Preparing a (quantum) belief system. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Philip Bille, Mikko Berggren Ettienne, Inge Li Gørtz, Hjalte Wedel Vildhøj Time-space trade-offs for Lempel-Ziv compressed indexing. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 12223 (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