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

Group by:
No Growbag Graphs found.

Results
Found 14585 publication records. Showing 14585 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1T.-H. Hubert Chan, Zhihao Gavin Tang, Quan Xue Max-min greedy matching problem: Hardness for the adversary and fractional variant. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Oliver Bachtler, Tim Bergner, Sven O. Krumke Almost disjoint paths and separating by forbidden pairs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Olga G. Parshina, Svetlana Puzynina Finite and infinite closed-rich words. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Dmitry Rabinovich, Michael Amir, Alfred M. Bruckstein Optimally reordering mobile agents on parallel rows. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Xiaojin Zhang 0002 Improved algorithm for permutation testing. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Dekel Tsur Algorithms for 2-club cluster deletion problems using automated generation of branching rules. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Tian Bai 0003, Mingyu Xiao 0001 Exact algorithms for restricted subset feedback vertex set in chordal and split graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Qin Lei, Hong Jin, Jia Lee, Jiang Zhong Land use and land cover change simulation enhanced by asynchronous communicating cellular automata. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Xiaojun Zhao, Qingying Deng, Xiaowang Li Relating g-good-neighbor connectivity and g-good-neighbor diagnosability of strong digraph network. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Martin Bullinger, Warut Suksompong Topological distance games. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Xiao-Tao Lü, Jin Chen, Zhi-Xiong Wen, Wen Wu 0002 On the 2-binomial complexity of the generalized Thue-Morse words. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Laurent Gourvès, Ararat Harutyunyan, Michael Lampis, Nikolaos Melissinos Filling crosswords is very hard. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Satyabrata Jana, Souvik Saha 0002, Abhishek Sahu, Saket Saurabh 0001, Shaily Verma Partitioning subclasses of chordal graphs with few deletions. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Rocco Ascone, Giulia Bernardini 0001, Luca Manzoni Fixed points and attractors of reactantless and inhibitorless reaction systems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Ioannis Caragiannis, Shivika Narang Repeatedly matching items to agents fairly and efficiently. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Michael A. Henning, Arti Pandey, Gopika Sharma, Vikash Tripathi Algorithms and hardness results for edge total domination problem in graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Liguan Wang, Yuan Li, Haibin Kan Obtaining simulation extractable NIZKs in the updatable CRS model generically. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Sumin Huang, Sergey Kitaev On ordering of β-description trees. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Qianru Zhou, Baolei Cheng, Jingya Zhou, Jia Yu 0005, Yan Wang 0078, Jianxi Fan Reliability evaluation for a class of recursive match networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Elisabeth Remy, Paul Ruet From multivalued to Boolean functions: Preservation of soft nested canalization. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Peng Yang, Yuan Huang, Zhiguo Fu The computational complexity of Holant problems on 3-regular graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Ren Tristan A. de la Cruz, Francis George C. Cabarle, Henry N. Adorna Steps toward a homogenization procedure for spiking neural P systems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Naonori Kakimura, Riku Nitta Randomized counter-based algorithms for frequency estimation over data streams in O(log⁡log⁡N) space. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Yi-Jun Chang The energy complexity of diameter and minimum cut computation in bounded-genus networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Firat Kiyak, A. C. Cem Say Energy complexity of regular languages. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Florian Bruse, Maurice Herwig, Martin Lange Weights of formal languages based on geometric series with an application to automatic grading. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Zhongzheng Tang, Jingwen Chen, Chenhao Wang 0001 Greedy+Singleton: An efficient approximation algorithm for k-submodular knapsack maximization. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Hengzhao Ma, Jianzhong Li 0001, Tianpeng Gao, Xiangyu Gao Turing machines with two-level memory: New computational models for analyzing the input/output complexity. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis Convex grid drawings of planar graphs with constant edge-vertex resolution. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Daniel Berend, Liat Cohen, Omrit Filtser A tour of general Hanoi graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Nada Almalki 0002, Othon Michail On geometric shape construction via growth operations. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Joan Boyar, Kim S. Larsen, Denis Pankratov Advice complexity of adaptive priority algorithms. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Davide Castelnovo, Fabio Gadducci, Marino Miculan A simple criterion for M,N-adhesivity. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Yan Lan, Yuan Yuan 0020, Yinling Wang, Xin Han, Yong Zhou Flow shop scheduling problems with transportation constraints revisited. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Shengminjie Chen, Donglei Du, Ruiqi Yang, Wenguo Yang, Yapu Zhang A single factor approximation ratio algorithm for DR-submodular maximization on integer lattice beyond non-negativity and monotonicity. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Xiaoming Sun 0001, Jialin Zhang, Shuo Zhang, Zhijie Zhang Improved deterministic algorithms for non-monotone submodular maximization. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Eléa Thibault Greugny, François Fages, Ovidiu Radulescu, Peter Szmolyan, Georgios N. Stamatas A skin microbiome model with AMP interactions and analysis of quasi-stability vs stability in population dynamics. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Tomás Dvorák, Mei-Mei Gu Paired 2-disjoint path covers of burnt pancake graphs with faulty elements. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan, Ankita Sarkar Popular critical matchings in the many-to-many setting. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Shuo Li A note on the Lie complexity and beyond. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Xianrun Chen, Sai Ji, Chenchen Wu, Yicheng Xu, Yang Yang An approximation algorithm for diversity-aware fair k-supplier problem. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Danny Hermelin, Leon Kellerhals, Rolf Niedermeier, Rami Pugatch Approximating sparse quadratic programs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Sameep Dahal, Jukka Suomela Distributed half-integral matching and beyond. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Binbin Tu, Yu Chen 0003, Hongrui Cui, Xianfang Wang Fast two-party signature for upgrading ECDSA to two-party scenario easily. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Xiaowei Huang, Shihao Zhang, Lvzhou Li Quantum algorithms for learning hidden strings with applications to matroid problems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Rahul Jain 0015, Raghunath Tewari Space efficient algorithm for solving reachability using tree decomposition and separators. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Yong Wang 0027 Finding the edges in optimal Hamiltonian cycles based on frequency quadrilaterals. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1L'ubomíra Dvoráková String attractors of episturmian sequences. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Subhash Bhagat, Andrzej Pelc Deterministic rendezvous in infinite trees. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Éric Duchêne, Nacim Oijid, Aline Parreau Bipartite instances of INFLUENCE. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Dimitrios Gerontitis, Changxin Mo, Predrag S. Stanimirovic, Vasilios N. Katsikis Improved zeroing neural models based on two novel activation functions with exponential behavior. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Ling Gai, Weiwei Zhang, Zhao Zhang 0002 Selfish bin packing with punishment. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Daniel Berend, S. Mamana A probabilistic algorithm for vertex cover. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Di Wang 0015, Jinhui Xu 0001 Gradient complexity and non-stationary views of differentially private empirical risk minimization. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Syohei Maruyama, Yuichi Sudo, Sayaka Kamei, Hirotsugu Kakugawa Self-stabilizing 2-minimal dominating set algorithms based on loop composition. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Hoa T. Vu Revisiting maximum satisfiability and related problems in data streams. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Nicola Rizzo 0001, Massimo Equi, Tuukka Norri, Veli Mäkinen Elastic founder graphs improved and enhanced. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Di Wu, Qilong Feng, Jianxin Wang 0001 Approximation algorithms for fair k-median problem without fairness violation. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Sam Coy, Artur Czumaj, Christian Scheideler, Philipp Schneider, Julian Werthmann Routing schemes for hybrid communication networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Kian Mirjalali, Hamid Zarrabi-Zadeh Massively parallel and streaming algorithms for balanced clustering. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Masaaki Kanzaki, Yota Otachi, Giovanni Viglietta, Ryuhei Uehara Computational complexity of jumping block puzzles. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Xiwen Wang, Kai Zhang 0016, Junqing Gong 0001, Shi-Feng Sun 0001, Jianting Ning Updatable searchable symmetric encryption: Definitions and constructions. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Amihood Amir, Eitan Kondratovsky, Gad M. Landau, Shoshana Marcus, Dina Sokol Reconstructing parameterized strings from parameterized suffix and LCP arrays. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Ghajendran Poovanandran, Jamie Simpson, Wen Chean Teh Counting subwords in circular words and their Parikh matrices. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Wen Yin, Jiarong Liang, Yuhao Xie, Changzhen Li The t/k-diagnosability of m-ary n-cube networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Yuzuru Tanaka Designing aperture 22k hexagonal grids and their indexing as factor rings of Eisenstein integers. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Bernard Berthomieu, Dmitry A. Zaitsev Sleptsov nets are Turing-complete. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Xiaoqing Liu, Baolei Cheng, Yan Wang 0078, Jia Yu 0005, Jianxi Fan Enhancing fault tolerance of balanced hypercube networks by the edge partition method. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Shenxing Zhang On the linearity of the periods of subtraction games. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
1Narendra Kumar, Siddhartha Siddhiprada Bhoi, Abhay Kumar Singh A study of primer design with w-constacyclic shift over F4. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Gewu Bu, Zvi Lotker, Maria Potop-Butucaru, Mikaël Rabie Lower and upper bounds for deterministic convergecast with labeling schemes. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli, Alessandra Tappini On the parameterized complexity of s-club cluster deletion problems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Zsolt Gazdag, Károly Hajagos A characterisation of P by DLOGTIME-uniform families of polarizationless P systems using only dissolution rules. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Kaige Pan Star fault tolerance of hypercube. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Riccardo Dondi Untangling temporal graphs of bounded degree. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Neel Karia, Faraaz Mallick, Palash Dey How hard is safe bribery? Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Alexandre M. Silva, Carlos Pereira dos Santos, João Pedro Neto, Richard J. Nowakowski Disjunctive sums of quasi-nimbers. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano Iterated uniform finite-state transducers on unary languages. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Eddie Cheng 0001, László Lipták, Ke Qiu 0001, Zhizhang Shen, Abhishek Vangipuram On the g-extra connectivity of augmented cubes. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Duri Janett, Johannes Lengler Two-dimensional drift analysis: Optimizing two functions simultaneously can be hard. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Hongbin Zhuang, Wanling Lin, Xiao-Yan Li, Jou-Ming Chang Matroidal connectivity and conditional matroidal connectivity of star graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
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
1Fu Li, C. Gregory Plaxton, Vaibhav B. Sinha The obnoxious facility location game with dichotomous preferences. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Tian Bai 0003, Mingyu Xiao 0001 A parameterized algorithm for subset feedback vertex set in tournaments. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Kelvin C. Buño, Henry N. Adorna Solving 3-SAT in distributed P systems with string objects. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Longkun Guo, Kewen Liao, Di Xiao 0005, Pei Yao Submodular maximization over data streams with differential privacy noise. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Eduardo Sany Laber, Lucas Murtinho Nearly tight bounds on the price of explainability for the k-center and the maximum-spacing clustering problems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1G. Jaykrishnan, Asaf Levin EPTAS for the dual of splittable bin packing with cardinality constraint. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Rasha Faqeh, André Martin, Valerio Schiavoni, Pramod Bhatotia, Pascal Felber, Christof Fetzer Capacity planning for dependable services. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Thierry Lecroq, Svetlana Puzynina TCS special issue: Combinatorics on Words - WORDS 2021. 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 0001, 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
1Takkolu Sree Lakshmi, Muthukumarasamy Govindarajan, Asadi Sreenivasulu Malware visual resemblance analysis with minimum losses using Siamese neural networks. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Sergio Rajsbaum A distributed computing perspective of unconditionally secure information transmission in Russian cards problems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Nicolas Bousquet, Felix Hommelsheim, Yusuke Kobayashi 0001, Moritz Mühlenthaler, Akira Suzuki Feedback vertex set reconfiguration in planar graphs. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Jan Goedgebeur, Shenwei Huang, Yiao Ju, Owen D. Merkel Colouring graphs with no induced six-vertex path or diamond. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Pamela Fleischmann, Lukas Haschke, Jonas Höfer, Annika Huch, Annika Mayrock, Dirk Nowotka Nearly k-universal words - Investigating a part of Simon's congruence. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Assaf Rabinowitz, Dror Rawitz Overflow management with self-eliminations. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
1Nicolai Kraus, Fredrik Nordvall Forsberg, Chuangjie Xu Type-theoretic approaches to ordinals. 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
Displaying result #1 - #100 of 14585 (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 L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license