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 (475) 2020 (581) 2021 (506) 2022 (421) 2023 (49)
Publication types (Num. hits)
article(14170)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 14170 publication records. Showing 14170 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Carsten Witt How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Guilhem Castagnos, Dario Catalano, Fabien Laguillaumie, Federico Savasta, Ida Tucker Bandwidth-efficient threshold EC-DSA revisited: Online/offline extensions, identifiable aborts proactive and adaptive security. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Chunying Ren, Zijun Wu, Dachuan Xu, Wenqing Xu A game-theoretic perspective of deep neural networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Eric Allender, John Gouwar, Shuichi Hirahara, Caleb Robelle Cryptographic hardness under projections for time-bounded Kolmogorov complexity. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Jonathan Heins, Jakob Bossek, Janina Pohl, Moritz Seiler, Heike Trautmann, Pascal Kerschke A study on the effects of normalized TSP features for automated algorithm selection. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Jannik Castenow, Jonas Harbig, Daniel Jung 0001, Till Knollmann, Friedhelm Meyer auf der Heide Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Szymon Lopaciuk, Daniel Reidenbach On Billaud words and their companions. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Suxia Jiang, Bowen Xu, Tao Liang, Xiaoliang Zhu, Tingfang Wu Numerical spiking neural P systems with production functions on synapses. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Danish Kashaev, Richard Santiago A simple optimal contention resolution scheme for uniform matroids. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Mingyu Xiao Upper and lower bounds on approximating weighted mixed domination. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Gabriel Istrate, Cosmin Bonchis A parametric worst-case approach to fairness in cooperative games with transferable utility. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Dora V. Bulgakova, Nicolas Buzhinsky, Yegor O. Goncharov On balanced and abelian properties of circular words over a ternary alphabet. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Esther Galby, Paloma T. Lima, Felix Mann, Bernard Ries Using edge contractions to reduce the semitotal domination number. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Konstantinos Georgiou, Jesse Lucier Weighted group search on a line & implications to the priority evacuation problem. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Jiangkun Li, Peng Zhang 0008 New approximation algorithms for the rooted Budgeted Cycle Cover problem. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Marius Bozga, Radu Iosif, Joseph Sifakis Verification of component-based systems with recursive architectures. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Andreas Galanis, Leslie Ann Goldberg, Daniel Stefankovic Implementations and the independent set polynomial below the Shearer threshold. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Vittorio Bilò, Laurent Gourvès, Jérôme Monnot Project games. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Gabriele Buriola, Domenico Cantone, Gianluca Cincotti, Eugenio G. Omodeo, Gaetano T. Spartà A decidable theory involving addition of differentiable real functions. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Susobhan Bandopadhyay, Suman Banerjee, Aritra Banik, Venkatesh Raman 0001 Structural parameterizations of budgeted graph coloring. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Carlos V. G. C. Lima, Thiago Marcilon, Nicolas Almeida Martins, Rudini Menezes Sampaio The connected greedy coloring game. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Yo-Sub Han, Sang-Ki Ko, Kai Salomaa Deciding path size of nondeterministic (and input-driven) pushdown automata. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Quentin Bramas, Anissa Lamani, Sébastien Tixeuil Stand up indulgent gathering. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Lila Kari Editorial. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Barnaby Martin, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen Few induced disjoint paths for H-free graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Julien Bensmail, Hervé Hocquard, Dimitri Lajou On the algorithmic complexity of determining the AVD and NSD chromatic indices of graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Martin Berglund, Brink van der Merwe Re-examining regular expressions with backreferences. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Declan Thompson Execution trace sets for real computation. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Jianxiong Guo, Xingjian Ding, Tian Wang 0001, Weijia Jia 0001 Theoretical design of decentralized auction framework under mobile crowdsourcing environment. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Xuan Kien Phung On invertible and stably reversible non-uniform cellular automata. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Dishant Goyal, Ragesh Jaiswal Tight FPT approximation for constrained k-center and k-supplier. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Honghui Xu, Wei Li 0059, Zhipeng Cai 0001 Analysis on methods to effectively improve transfer learning performance. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Simone Faro, Stefano Scafiti Compact suffix automata representations for searching long patterns. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Xiaojia Xu, Yongcai Wang, Yu Zhang, Deying Li 0001 A fault diagnosis method to defend scapegoating attack in network tomography. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Dekel Tsur Faster parameterized algorithms for two vertex deletion problems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Michael J. Dinneen, Pankaj S. Ghodla, Simone Linz A QUBO formulation for the Tree Containment problem. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Zhiyuan An, Jing Pan, Yamin Wen, Fangguo Zhang Secret handshakes: Full dynamicity, deniability and lattice-based design. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Ko Minamisawa, Ryuhei Uehara, Masao Hara Mathematical characterizations and computational complexity of anti-slide puzzles. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Nikolay K. Vereshchagin Information disclosure in the framework of Kolmogorov complexity. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Zichen Wang, Hongwei Du 0001 Collaborative coalitions-based joint service caching and task offloading for edge networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Mikhail A. Raskin Protocols with constant local storage and unreliable communication. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Francesco Dolce, L'ubomíra Dvoráková, Edita Pelantová On balanced sequences and their critical exponent. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Karam Aloui, Damien Jamet, Hajime Kaneko, Steffen Kopecki, Pierre Popoli, Thomas Stoll On the binary digits of n and n2. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Hong Zhang, Shuming Zhou, Xiaoqing Liu, Zhenqin Yu Extra (component) connectivity and diagnosability of bubble sort networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Yuxing Yang, Ningning Song Fault-free Hamiltonian paths passing through prescribed linear forests in balanced hypercubes with faulty links. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Peter Hertling Remarks on the effective Jordan decomposition. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Clément Rambaud, Magnus Wahlström, Anders Yeo Preference swaps for the stable matching problem. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Frédéric Giroire, Stéphane Pérennes, Thibaud Trolliet A random growth model with any real or theoretical degree distribution. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Geevarghese Philip, M. R. Rani, R. Subashini On computing the Hamiltonian index of graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Irena Rusu Hamiltonian problems in directed graphs with simple row patterns. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Natalie C. Behague, Anthony Bonato, Melissa A. Huggan, Trent G. Marbach, Brittany Pittman The localization capture time of a graph. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Viet-Ha Nguyen 0004, Kévin Perrot Rikudo is NP-complete. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Evripidis Bampis, Dimitris Christou, Bruno Escoffier, Alexander V. Kononov, Kim Thang Nguyen A simple rounding scheme for multistage optimization. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Hugo Gilbert, Tom Portoleau, Olivier Spanjaard Beyond pairwise comparisons in social choice: A setwise Kemeny aggregation problem. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Lee-Ad Gottlieb, Robert Krauthgamer, Havana Rika Faster algorithms for orienteering and k-TSP. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Ting-Wei Liang, Chang-Biau Yang, Kuo-Si Huang An efficient algorithm for the longest common palindromic subsequence problem. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Alan Diêgo Aurélio Carneiro, Fábio Protti, Uéverton dos Santos Souza On knot-free vertex deletion: Fine-grained parameterized complexity analysis of a deadlock resolution graph problem. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Xuehou Tan, Qi Wei Improved exploration of unknown polygons. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Yuichi Asahiro, Jesper Jansson 0001, Eiji Miyano, Hirotaka Ono Upper and lower degree-constrained graph orientation with minimum penalty. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Zhen Zhang 0025, Yipeng Zhou, Shaoqian Yu Better guarantees for k-median with service installation costs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Jianer Chen, Minjie Huang, Yin Guo Scheduling multiple two-stage flowshops with a deadline. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Sheng Chen 0007, Yi Dai Delta invariant for Eulerian digraphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Lantao You, Yuejuan Han, Jianxi Fan, Dong Ye Structure fault tolerance of WK-recursive networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Carl Barton On the average-case complexity of pattern matching with wildcards. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Andrei Alexandru, Bogdan Aman, Ross Horne Theories of life and computation: Special issue on the occasion of the 65th birthday of Professor Gabriel Ciobanu. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Ya-Chun Liang, Kuan-Yun Lai, Ho-Lin Chen, Kazuo Iwama, Chung-Shou Liao Tight competitive analyses of online car-sharing problems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Lila Kari Editorial. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Dekel Tsur Faster algorithm for pathwidth one vertex deletion. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Thomas Bläsius, Tobias Friedrich 0001, Martin Schirneck The complexity of dependency detection and discovery in relational databases. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Dongqin Cheng Embedding mutually edge-disjoint cycles into locally twisted cubes. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Murray Elder, Adam Piggott Rewriting systems, plain groups, and geodetic graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Kirstin Peters, Uwe Nestmann, Anna Schmitt 0002 On distributability. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Tooru Akagi, Yuki Kuhara, Takuya Mieno, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda Combinatorics of minimal absent words for a sliding window. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1André Nies, Frank Stephan 0001 Randomness and initial segment complexity for measures. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Marina Moscarini Computing a metric basis of a bipartite distance-hereditary graph. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Yuniel Matos-Rodríguez, Evaristo José Madarro-Capó, Carlos Miguel Legón-Pérez, Omar Rojas, Guillermo Sosa Gómez Improvements in the computing efficiency of the probabilities of the LIL test for the PRNG evaluation. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Xujun Liu, Olgica Milenkovic Finding the second-best candidate under the Mallows model. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Sujoy Bhore, Satyabrata Jana, Supantha Pandit, Sasanka Roy The balanced connected subgraph problem for geometric intersection graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Shiyu Shen, Hongbing Wang, Yunlei Zhao Identity-based authenticated encryption with identity confidentiality. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Qizhe Yang, Yuxi Fu Counting nondeterministic computations. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Sayan Bandyapadhyay, Tanmay Inamdar 0002, Shreyas Pai, Sriram V. Pemmaraju Near-optimal clustering in the k-machine model. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Guy Kortsarz, Zeev Nutov, Eli Shalom Approximating activation edge-cover and facility location problems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Xiaoguang Bao, Lei Xu, Wei Yu, Wei Song Approximation algorithms for the min-max clustered k-traveling salesmen problems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Aviv Bar-Natan, Panagiotis Charalampopoulos, Pawel Gawrychowski, Shay Mozes, Oren Weimann Fault-tolerant distance labeling for planar graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Michel Raynal, Gadi Taubenfeld A visit to mutual exclusion in seven dates. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Pierre Hosteins, Rosario Scatamacchia, Andrea Grosso, Roberto Aringhieri The Connected Critical Node Problem. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Girija Vani Gurram, C. Noorullah Shariff, Rajkumar L. Biradar A Secure Energy Aware Meta-Heuristic Routing Protocol (SEAMHR) for sustainable IoT-Wireless Sensor Network (WSN). Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Saeed Akhoondian Amiri, Ben Wiederhake Distributed distance-r covering problems on sparse high-girth graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Nianpeng Zhang, Qiang Zhu 0003 Two important parameters of HPMC model. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1K. R. Sekar, Naga Raju M, Mohd Anul Haq, Anil Kumar 0009, R. Shalini, S. Poojalaxmi An improved ranking methodology for malignant carcinoma in multicriterian decision making using hesitant VIKOR fuzzy. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Jingjing Tan, Fengmin Wang, Weina Ye, Xiaoqing Zhang, Yang Zhou 0018 Streaming algorithms for monotone non-submodular function maximization under a knapsack constraint on the integer lattice. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Ankush Acharyya, Ramesh K. Jallu, Vahideh Keikha, Maarten Löffler, Maria Saumell Minimum color spanning circle of imprecise points. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1C. Sudha, D. Suresh, A. Nagesh Accurate data aggregation created by neural network and data classification processed through machine learning in wireless sensor networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Miroslav Stankovic, Ezio Bartocci, Laura Kovács Moment-based analysis of Bayesian network properties. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Daniel Coronel, Alexander Frank, Mathieu Hoyrup, Cristobal Rojas Realizing semicomputable simplices by computable dynamical systems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1G. Revathy, K. Bhavana Raj, Anil Kumar 0009, Spurthi Adibatti, Priyanka Dahiya, T. M. Latha Investigation of E-voting system using face recognition using convolutional neural network (CNN). Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Frank Angel Hernández Mira, Ernesto Parra Inza, José M. Sigarreta Almira, Nodari Vakhania A polynomial-time approximation to a minimum dominating set in a graph. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Zhao Jin, Bowen Zhang, Tianyue Cao, Yongzhi Cao, Hanpin Wang Reasoning about block-based cloud storage systems via separation logic. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1El-Mahdi El-Mhamdi, Rachid Guerraoui, Lê-Nguyên Hoang, Alexandre Maurer Removing algorithmic discrimination (with minimal individual error). Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
1Louis Dublois, Michael Lampis, Vangelis Th. Paschos Upper Dominating Set: Tight algorithms for pathwidth and sub-exponential approximation. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 14170 (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