Computer Science

OALib Journal期刊
ISSN: 2333-9721
费用：99美元

投递稿件

为什么选择我们？ >>

- 开源期刊

- 同行审议

- 快速出刊

- 终身存储

- 免费检索

- 免费推广

- 更多...

- 搜索引擎

Computer Science

ISSN Print:

ISSN Online:

主页: http://arxiv.org/corr

Geometric Set Cover and Hitting Sets for Polytopes in $R^3$

S？ren Laue

Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs

Menelaos I. Karavelas

Well-Centered Triangulation

Evan VanderZee,Anil N. Hirani,Damrong Guoy,Edgar Ramos

The Generation of Textual Entailment with NLML in an Intelligent Dialogue system for Language Learning CSIEC

Jiyou Jia

Model Checking Games for the Quantitative mu-Calculus

Diana Fischer,Erich Gr？del,Lukasz Kaiser

On the Complexity of Nash Equilibria of Action-Graph Games

Constantinos Daskalakis,Grant Schoenebeck,Gregory Valiant,Paul Valiant

Complexity of Combinatorial Market Makers

Yiling Chen,Lance Fortnow,Nicolas Lambert,David M. Pennock,Jennifer Wortman

Outward Accessibility in Urban Street Networks: Characterization and Improvements

Bruno Augusto Nassif Traven？olo,Luciano da Fontoura Costa

An Empirical Study of End-User Behaviour in Spreadsheet Error Detection & Correction

Brian Bishop,Kevin McDaid

A New Approach to Spreadsheet Analytics Management in Financial Markets

Brian Sentence

Automatic Verification of Correspondences for Security Protocols

Bruno Blanchet

On the Security of ``an efficient and complete remote user authentication scheme''

Manik Lal Das

Longest paths in Planar DAGs in Unambiguous Logspace

Nutan Limaye,Meena Mahajan,Prajakta Nimbhorkar

Some properties of the Ukrainian writing system

Solomija Buk,Ján Ma？utek,Andrij Rovenchak

Textual Fingerprinting with Texts from Parkin, Bassewitz, and Leander

Christoph Schommer,Conny Uhde

Solving the Maximum Agreement SubTree and the Maximum Compatible Tree problems on many bounded degree trees

Sylvain Guillemot,Francois Nicolas

Curves That Must Be Retraced

Xiaoyang Gu,Jack H. Lutz,Elvira Mayordomo

Generic case complexity and One-Way functions

Alex D. Myasnikov

A O(n^8) X O(n^7) Linear Programming Model of the Quadratic Assignment Problem

Moustapha Diaby

On Cobweb Posets and Discrete F-Boxes Tilings

M. Dziemianczuk

On the Kuratowski graph planarity criterion

A. Skopenkov

(Generalized) Post Correspondence Problem and semi-Thue systems

Francois Nicolas

More on the Bernoulli and Taylor Formula for Extended Umbral Calculus

A. Krzysztof Kwasniewski

A connection between palindromic and factor complexity using return words

Michelangelo Bucci,Alessandro De Luca,Amy Glen,Luca Q. Zamboni

A proposal to a generalised splicing with a self assembly approach

L. Jeganathan,R. Rama,Ritabrata Sengupta

Knowledge management by wikis

Sander Spek

Another approach to decide on real root existence for univariate Polynomials, and a multivariate extension for 3-SAT

Deepak Ponvel Chermakani

Characterising through Erasing: A Theoretical Framework for Representing Documents Inspired by Quantum Theory

álvaro Francisco Huertas-Rosero,Leif Azzopardi,C. J. van Rijsbergen

An Empirical Study of Cache-Oblivious Priority Queues and their Application to the Shortest Path Problem

Benjamin Sach,Rapha？l Clifford

Average-Case Analysis of Online Topological Ordering

Deepak Ajwani,Tobias Friedrich

Generalized Whac-a-Mole

Marcin Bienkowski,Marek Chrobak,Christoph Durr,Mathilde Hurand,Artur Jez,Lukasz Jez,Jakub Lopuszanski,Grzegorz Stachowiak

Digraph Decompositions and Monotonicity in Digraph Searching

Stephan Kreutzer,Sebastian Ordyniak

Min-Cost 2-Connected Subgraphs With k Terminals

Chandra Chekuri,Nitish Korula

Improved Approximations for Multiprocessor Scheduling Under Uncertainty

Christopher Crutchfield,Zoran Dzunic,Jeremy T. Fineman,David R. Karger,Jacob Scott

Understanding maximal repetitions in strings

Maxime Crochemore,Lucian Ilie

Trimmed Moebius Inversion and Graphs of Bounded Degree

Andreas Bj？rklund,Thore Husfeldt,Petteri Kaski,Mikko Koivisto

Sketch-Based Estimation of Subpopulation-Weight

Edith Cohen,Haim Kaplan

Minimum Entropy Orientations

Jean Cardinal,Samuel Fiorini,Gwena？l Joret

Error-Correcting Data Structures

Ronald de Wolf

Parameterized Algorithms for Partial Cover Problems

Omid Amini,Fedor V. Fomin,Saket Saurabh

An Improved Randomized Truthful Mechanism for Scheduling Unrelated Machines

Pinyan Lu,Changyuan Yu

Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs

Samir Datta,Raghav Kulkarni,Sambuddha Roy

Computing Minimum Spanning Trees with Uncertainty

Thomas Erlebach,Michael Hoffmann,Danny Krizanc,Matús Mihal'ák,Rajeev Raman

Trimming of Graphs, with Application to Point Labeling

Thomas Erlebach,Torben Hagerup,Klaus Jansen,Moritz Minzlaff,Alexander Wolff

Deriving Sorting Algorithms

José Bacelar Almeida,Jorge Sousa Pinto

Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees

Viet Tung Hoang,Wing-Kin Sung

Neural Networks and Database Systems

Erich Schikuta

Fault-Tolerant Partial Replication in Large-Scale Database Systems

Pierre Sutra,Marc Shapiro

Towards a formalization of budgets

Jan A. Bergstra,Sanne Nolst Trenité,Mark B. van der Zwaag

Color Graphs: An Efficient Model For Two-Dimensional Cellular Automata Linear Rules

Birendra Kumar Nayak,Sudhakar Sahoo,Sushant Kumar Rout