Computer Science

51219 papers in Computer Science

Explore Subcategories

Information Theory
1601 Papers
Artificial Intelligence
1580 Papers
Cryptography and Security
1290 Papers
Data Structures and Algorithms
1258 Papers
Networking
1126 Papers
Discrete Mathematics
1039 Papers
Distributed Computing
981 Papers
Logic in Computer Science
972 Papers
Software Engineering
935 Papers
Machine Learning
932 Papers
Computers and Society
915 Papers
Computational Complexity
861 Papers
TITLE
DATE
VIEWS
Essential variables and positions in terms
By Slavcho Shtrakov · ArXiv: 0802.2385
2010-01-19
0
On Maximizing Coverage in Gaussian Relay Networks
By Vaneet Aggarwal, Amir Bennatan, A. Robert Calderbank · ArXiv: 0802.2360
2017-08-04
0
Algebraic geometry codes from higher dimensional varieties
By John B. Little · ArXiv: 0802.2349
2008-02-19
0
On the Frame Error Rate of Transmission Schemes on Quasi-Static Fading Channels
By Ioannis Chatzigeorgiou, Ian J. Wassell, Rol · ArXiv: 0802.2345
2022-03-08
0
The Stength of Weak cooperation: A Case Study on Flickr
By Christophe Prieur (LIAFA), Dominique Cardon, Jean-Samuel Beuscart · ArXiv: 0802.2317
2008-02-19
0
Software graphs and programmer awareness
By G. J. Baxter, M. R. Frean · ArXiv: 0802.2306
2008-02-19
0
Compressed Counting
By Ping Li · ArXiv: 0802.2305
2008-02-24
0
Approximation Resistant Predicates From Pairwise Independence
By Per Austrin, Elchanan Mossel · ArXiv: 0802.2300
2008-02-19
0
Using Alloy to model-check visual design notations
By Anthony J. H. Simons, Carlos Alberto Fernández y Fernández (Department of Computer Science, University of Sheffield) · ArXiv: 0802.2258
2008-02-18
1
Digraph Decompositions and Monotonicity in Digraph Searching
By Stephan Kreutzer, Sebastian Ordyniak · ArXiv: 0802.2228
2008-02-18
0
Set Covering Problems with General Objective Functions
By Jean Cardinal, Christophe Dumeunier · ArXiv: 0802.2184
2008-02-18
0
Bounds on the Number of Numerical Semigroups of a Given Genus
By **Maria Bras‑Amorós** (주요 저자) – 스페인, Universidad de Granada. (공동 저자 정보가 논문에 명시되지 않은 경우, 본 논문은 단일 저자 저작으로 간주) ### · ArXiv: 0802.2175
2008-02-18
0
A Radar-Shaped Statistic for Testing and Visualizing Uniformity Properties in Computer Experiments
By Jessica Franco, Laurent Carraro, Olivier Roustant · ArXiv: 0802.2158
2008-02-19
0
Choice numbers of graphs
By ** 논문에 명시된 저자 정보는 원문에 포함되지 않았으나, 주요 아이디어는 Erdős, Rubin · ArXiv: 0802.2157
2008-02-18
0
Minimizing the Maximum Interference is Hard
By Kevin Buchin · ArXiv: 0802.2134
2011-10-11
0
New Implementation Framework for Saturation-Based Reasoning
By Alex, re Riazanov · ArXiv: 0802.2127
2008-02-18
0
Multiple Access Outerbounds and the Inseparability of Parallel Interference Channels
By Viveck R. Cadambe, Syed A. Jafar · ArXiv: 0802.2125
2016-11-17
0
On the Security of ``an efficient and complete remote user authentication scheme
By Manik Lal Das · ArXiv: 0802.2112
2008-02-18
0
Blocking Sets in the complement of hyperplane arrangements in projective space
By ** S. Settepanella (소속: Dipartimento di Scienze della Comunicazione, Colle Parco, 64100 Teramo · ArXiv: 0802.2045
2008-02-15
0
Kolmogorov Complexity Theory over the Reals
By Martin Ziegler, Wouter M. Koolen · ArXiv: 0802.2027
2008-03-28
0
Combining Expert Advice Efficiently
By Wouter Koolen, Steven de Rooij · ArXiv: 0802.2015
2008-02-15
0
Throughput-Delay Trade-off for Hierarchical Cooperation in Ad Hoc Wireless Networks
By Ayfer Ozgur, Olivier Leveque · ArXiv: 0802.2013
2016-11-17
0
To Broad-Match or Not to Broad-Match : An Auctioneers Dilemma ?
By Sudhir Kumar Singh, Vwani P. Roychowdhury · ArXiv: 0802.1957
2008-07-21
0
Diversity and Degrees of Freedom of Cooperative Wireless Networks
By ** K. Sreeram, S. Birenjith, P. Vijay Kumar ** · ArXiv: 0802.1893
2008-02-14
0
On the Complexity of Elementary Modal Logics
By Edith Hemaspa, ra, Henning Schnoor · ArXiv: 0802.1884
2008-02-14
0
A review of the Statistical Mechanics approach to Random Optimization Problems
By Fabrizio Altarelli, Remi Monasson, Guilhem Semerjian · ArXiv: 0802.1829
2009-01-08
0
A Construction for Constant-Composition Codes
By Yang Ding · ArXiv: 0802.1815
2016-11-15
0
SAT Has No Wizards
By Silvano Di Zenzo · ArXiv: 0802.1790
2008-02-14
0
Near ML detection using Dijkstras algorithm with bounded list size over MIMO channels
By ** - Atsushi Okawado (오카와도 아츠시) – 도쿄공업대학 통신·통합시스템학부 - Ryutaroh Matsumoto (마쓰모토 류타로) – 도쿄공업대학 통신·통합시스템학부 - Tomohiko Uyematsu (우에마쓰 토모히코) – 도쿄공업대학 통신·통합시스템학부 ** · ArXiv: 0802.1785
2008-09-02
0
ARQ for Network Coding
By Jay Kumar Sundararajan, Devavrat Shah, Muriel Medard · ArXiv: 0802.1754
2016-11-17
0
«« « 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 » »»