The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

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

Publication years (Num. hits)
1967 (26) 1968 (23) 1969 (23) 1970 (35) 1971 (35) 1972 (35) 1973 (35) 1974 (43) 1975 (45) 1976 (48) 1977 (39) 1978 (49) 1979 (45) 1980 (42) 1981 (47) 1982 (39) 1983 (46) 1984 (47) 1985 (40) 1986 (43) 1987 (35) 1988 (41) 1989 (39) 1990 (33) 1991 (37) 1992 (44) 1993 (35) 1994 (60) 1995 (83) 1996 (81) 1997 (68) 1998 (49) 1999 (62) 2000 (52) 2001 (65) 2002 (72) 2003 (71) 2004 (68) 2005 (58) 2006 (70) 2007 (72) 2008 (88) 2009 (32) 2010 (63) 2011 (80) 2012 (120) 2013 (90) 2014 (105) 2015 (107) 2016 (77) 2017 (110) 2018 (67) 2019 (65) 2020 (9)
Publication types (Num. hits)
article(2993)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 2993 publication records. Showing 2993 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Fabrizio Frati, Maurizio Patrignani, Vincenzo Roselli LR-drawings of ordered rooted binary trees and near-linear area drawings of outerplanar graphs. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Anurag Anshu, Peter Høyer, Mehdi Mhalla, Simon Perdrix Contextuality in multipartite pseudo-telepathy graph games. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Ernesto Jiménez, José Luis López-Presa, Javier Martín-Rueda Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Reino Niskanen, Igor Potapov, Julien Reichert On decidability and complexity of low-dimensional robot games. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Eleni C. Akrida, George B. Mertzios, Paul G. Spirakis, Viktor Zamaraev Temporal vertex cover with a sliding time window. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Heng Guo 0001, Tyson Williams The complexity of planar Boolean #CSP with complex weights. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1David Gajser Verifying whether one-tape Turing machines run in linear time. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Philipp Zschoche, Till Fluschnik, Hendrik Molter, Rolf Niedermeier The complexity of finding small separators in temporal graphs. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Juraj Hromkovic, Peter Rossmanith What one has to know when attacking P vs. NP. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
1Martin Sulzmann, Peter Thiemann Derivatives and partial derivatives for regular shuffle expressions. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Norikazu Takahashi, Daiki Hirata, Shuji Jimbo, Hiroaki Yamamoto Band-restricted diagonally dominant matrices: Computational complexity and application. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Takayuki Sakai, Kazuhisa Seto, Suguru Tamaki, Junichi Teruyama Bounded depth circuits with weighted symmetric gates: Satisfiability, lower bounds and compression. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ryo Yoshinaka Distributional learning of conjunctive grammars and contextual binary feature grammars. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Dominik D. Freydenberger, Markus L. Schmid Deterministic regular expressions with back-references. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Nicolás Alvarez, Verónica Becher, Olivier Carton Finite-state independence and normal sequences. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Adrien Boiret, Vincent Hugot, Joachim Niehren, Ralf Treinen Logics for unordered trees with data constraints. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Albert Atserias, Phokion G. Kolaitis, Simone Severini Generalized satisfiability problems via operator assignments. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Michael Codish, Luís Cruz-Filipe, Thorsten Ehlers, Mike Müller, Peter Schneider-Kamp Sorting networks: To the end and back again. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Adrian Kosowski, Dominik Pajak Does adding more agents make a difference? A case study of cover time for the rotor-router. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Laurent Doyen 0001, Thierry Massart, Mahsa Shirmohammadi The complexity of synchronizing Markov decision processes. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Dariusz Dereniowski, Andrzej Lingas, Dorota Osula, Mia Persson, Pawel Zylinski Clearing directed subgraphs by mobile agents: Variations on covering with paths. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Johanna Björklund, Frank Drewes, Niklas Zechner Efficient enumeration of weighted tree languages over the tropical semiring. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Till Fluschnik, Stefan Kratsch, Rolf Niedermeier, Manuel Sorge The parameterized complexity of the minimum shared edges problem. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Othon Michail, George Skretas, Paul G. Spirakis On the transformation capability of feasible mechanisms for programmable matter. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Raphaël Bailly, Guillaume Rabusseau, François Denis Recognizable series on graphs and hypergraphs. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Walter Didimo, Giuseppe Liotta, Maurizio Patrignani HV-planarity: Algorithms and complexity. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jérémie Cabessa, Olivier Finkel Computational capabilities of analog and evolving neural networks over infinite input streams. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Vidhya Ramaswamy, Jayalal Sarma, K. S. Sunil Space complexity of reachability testing in labelled graphs. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Maciej Liskiewicz, Matthias Lutter, Rüdiger Reischuk Proper learning of k-term DNF formulas from satisfying assignments. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Marco Autili, Paola Inverardi, Romina Spalazzese, Massimo Tivoli, Filippo Mignosi Automated synthesis of application-layer connectors from automata-based specifications. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Eleni C. Akrida, Jurek Czyzowicz, Leszek Gasieniec, Lukasz Kuszner, Paul G. Spirakis Temporal flows in temporal networks. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Parvaneh Babari, Manfred Droste A Nivat theorem for weighted picture automata and weighted MSO logics. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1H. K. Dai 0001, Z. Wang Two parallel algorithms for finding all minimal maximum subsequences. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Vojtech Vorel, Adam Roman Complexity of road coloring with prescribed reset words. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Eduard Eiben, Danny Hermelin, M. S. Ramanujan On approximate preprocessing for domination and hitting subgraphs with connected deletion sets. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Sanjay Jain 0001, Alexei Miasnikov, Frank Stephan 0001 The complexity of verbal languages over groups. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Lakshmi Anantharamu, Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki Packet latency of deterministic broadcasting in adversarial multiple access channels. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Olaf Beyersdorff, Leroy Chew, Karteek Sreenivasaiah A game characterisation of tree-like Q-Resolution size. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Marc Gyssens, Jelle Hellings, Jan Paredaens, Dirk Van Gucht, Jef Wijsen, Yuqing Wu Calculi for symmetric queries. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Bastien Cazaux, Thierry Lecroq, Eric Rivals Linking indexing data structures to de Bruijn graphs: Construction and update. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Emmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin Decidable weighted expressions with Presburger combinators. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Florent Jacquemard, Michaël Rusinowitch One-variable context-free hedge automata. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Erik D. Demaine, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar, Blair D. Sullivan Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Stefano Bilotta, Elisa Pergola, Renzo Pinzani, Simone Rinaldi Recurrence relations, succession rules and the positivity problem. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Cheng Luo, Bo Zhang 0004, Yang Xiang, Man Qi Gaussian-Gamma collaborative filtering: A hierarchical Bayesian model for recommender systems. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Douglas Burdick, Ronald Fagin, Phokion G. Kolaitis, Lucian Popa 0001, Wang-Chiew Tan Expressive power of entity-linking frameworks. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1János Balogh, József Békési, György Dósa, Jirí Sgall, Rob van Stee The optimal absolute ratio for online bin packing. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Gregory Z. Gutin, M. S. Ramanujan, Felix Reidl, Magnus Wahlström Path-contractions, edge deletions and connectivity preservation. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Filip Mazowiecki, Cristian Riveros Copyless cost-register automata: Structure, expressiveness, and closure properties. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Till Fluschnik, Marco Morik, Manuel Sorge The complexity of routing with collision avoidance. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Guilhem Gamard, Gwénaël Richomme Coverability and multi-scale coverability on infinite pictures. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Hitoshi Koyano, Morihiro Hayashida, Tatsuya Akutsu Optimal string clustering based on a Laplace-like mixture and EM algorithm on a set of strings. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Pawel Gawrychowski, Florin Manea, Robert Mercas, Dirk Nowotka Hide and seek with repetitions. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Matthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier Parameterized aspects of triangle enumeration. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté Counting minimal transversals of β-acyclic hypergraphs. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Lane A. Hemaspaandra, Daniel Rubery Recursion-theoretic ranking and compression. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Nir Drucker, Hsi-Ming Ho, Joël Ouaknine, Michal Penn, Ofer Strichman Cyclic-routing of Unmanned Aerial Vehicles. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ryszard Janicki, Jetty Kleijn, Maciej Koutny, Lukasz Mikulski Classifying invariant structures of step traces. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Konrad K. Dabrowski, Shenwei Huang, Daniël Paulusma Bounding clique-width via perfect graphs. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Eric Allender, Ian Mertz Complexity of regular functions. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Georg Bachmeier, Felix Brandt 0001, Christian Geist, Paul Harrenstein, Keyvan Kardel, Dominik Peters, Hans Georg Seedig k-Majority digraphs and the hardness of voting with a constant number of voters. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yohan Boichut, Jacques Chabin, Pierre Réty Towards more precise rewriting approximations. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yue Ben, Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan 0001 Decidable and expressive classes of probabilistic automata. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Adrian-Horia Dediu, Carlos Martín-Vide, Bianca Truthe Special issue: Selected papers of the 9th International Conference on Language and Automata Theory and Applications, LATA 2015. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Joey Eremondi, Oscar H. Ibarra, Ian McQuillan Insertion operations on deterministic reversal-bounded counter machines. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Serge Gaspers, Shenwei Huang, Daniël Paulusma Colouring square-free graphs without long induced paths. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Kim-Kwang Raymond Choo, Jemal H. Abawajy, Md. Rafiqul Islam 0001 Special issue on cybersecurity in the critical infrastructure: Advances and future directions. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jung-Heum Park, Hyeong-Seok Lim, Hee-Chul Kim Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Yair Bartal, Arnold Filtser, Ofer Neiman On notions of distortion and an almost minimum spanning tree with constant average distortion. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Leah Epstein, Asaf Levin On the performance guarantee of First Fit for sum coloring. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Jakub Gajarský, Petr Hlinený, Martin Koutecký, Shmuel Onn Parameterized shifted combinatorial optimization. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Zheng Wang An elastic and resiliency defense against DDoS attacks on the critical DNS authoritative infrastructure. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Igor Potapov, Pavel Semukhin Vector and scalar reachability problems in SL(2, Z). Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Ashley Farrugia, Leszek Gasieniec, Lukasz Kuszner, Eduardo Pacheco Deterministic rendezvous with different maps. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Hayat Nasser, Phuc Ngo, Isabelle Debled-Rennesson Dominant point detection based on discrete curve structure and applications. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ji Guan, Yuan Feng, Mingsheng Ying Decomposition of quantum Markov chains and its applications. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Georg Gottlob, Gianluigi Greco, Francesco Scarcello Tree projections and constraint optimization problems: Fixed-parameter tractability and parallel algorithms. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Xiao Liu 0007, Mianxiong Dong, Kaoru Ota, Laurence T. Yang, Anfeng Liu Trace malicious source to guarantee cyber security for mass monitor critical infrastructure. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Akanksha Agrawal, Saket Saurabh 0001, Roohani Sharma, Meirav Zehavi Kernels for deletion to classes of acyclic digraphs. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Prachi Goyal, Pranabendu Misra, Fahad Panolan, Geevarghese Philip, Saket Saurabh 0001 Finding even subgraphs even faster. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1George Barmpalias, Andrew Lewis-Pye Optimal redundancy in computations from random oracles. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Guangya Cai, Daowen Qiu Optimal separation in exact query complexities for Simon's problem. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ran Canetti, Ling Cheung, Dilsun Kirli Kaynar, Moses D. Liskov, Nancy A. Lynch, Olivier Pereira, Roberto Segala Task-structured probabilistic I/O automata. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Yuping Ke, Yixin Cao 0001, Xiating Ouyang, Wenjun Li, Jianxin Wang Unit interval vertex deletion: Fewer vertices are relevant. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Alkida Balliu, Gianlorenzo D'Angelo, Pierre Fraigniaud, Dennis Olivetti What can be verified locally? Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1A. Karim Abu-Affash, Paz Carmi, Anat Parush Tzur Dual power assignment via second Hamiltonian cycle. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Loïc Mazo, Étienne Baudrier Object digitization up to a translation. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Limei Lin, Sun-Yuan Hsieh, Li Xu 0002, Shuming Zhou, Riqing Chen The relationship between extra connectivity and conditional diagnosability of regular graphs under the PMC model. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Eduard Eiben, Robert Ganian, O-joung Kwon A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Antonín Kucera 0001, Richard Mayr A generic framework for checking semantic equivalences between pushdown automata and finite-state automata. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Rocío González-Díaz, Maria Jose Jimenez, Belén Medrano Topological tracking of connected components in image sequences. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Víctor Dalmau, Andrei A. Krokhin, Rajsekar Manokaran Towards a characterization of constant-factor approximable finite-valued CSPs. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Paul W. Goldberg, Christos H. Papadimitriou Towards a unified complexity theory of total functions. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Laurent Bienvenu, Santiago Figueira, Benoit Monin, Alexander Shen Algorithmic identification of probabilities is hard. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Gábor Ivanyos, Raghav Kulkarni, Youming Qiao, Miklos Santha, Aarthi Sundaram On the complexity of trial and error for constraint satisfaction problems. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Balagopal Komarath, Jayalal Sarma, Saurabh Sawlani Pebbling meets coloring: Reversible pebble game on trees. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Salvador Lucas, José Meseguer, Raúl Gutiérrez The 2D Dependency Pair Framework for conditional rewrite systems. Part I: Definition and basic processors. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mahdi Cheraghchi, Elena Grigorescu, Brendan Juba, Karl Wimmer, Ning Xie 0002 AC0∘MOD2 lower bounds for the Boolean Inner Product. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Foto N. Afrati, Shantanu Sharma 0001, Jonathan R. Ullman, Jeffrey D. Ullman Computing marginals using MapReduce. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Quentin F. Stout Weighted L∞ isotonic regression. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 2993 (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