Questions tagged [reference-request]
Questions requesting papers in the literature on specific, narrow issues.
925
questions
1
vote
0answers
10 views
Asking for references on errors, testing, system failures etc
I am looking for references that talk about the following subject:
Software programs are in general complex systems. That is, if we decompose them into components and we make sure that each component ...
1
vote
1answer
25 views
Algorithmic information theory with stochastic algorithms?
Suppose we define a class of algorithms that is allowed to sample i.i.d. Bernoulli bitstrings of arbitrary length, and use these to generate outputs. If we are allowed to use algorithms like this, ...
1
vote
0answers
14 views
Degree of regularity of a Markov chain
A Markov chain with transition matrix $P$ is termed regular if for some $n$, all entries of $P^n$ are positive.
Is there a known notion of degree of regularity quantified in terms of how soon all ...
1
vote
0answers
28 views
Reliability of information on large social networks like Wikipedia [closed]
I was going through the playlist of an online course on Social Network Analysis offered by the Indian Institute of Technology (Madras), when I came across the claim that "when a lot of people get ...
2
votes
1answer
18 views
What is a self-delimiting program?
I came across the term self-delimiting program, referring to the paper "Laws of information (nongrowth) and aspects of the foundation of probability theory" by Levin, 1974.
Unfortunately ...
2
votes
0answers
17 views
Generalization of finding $L_\infty$ centroid in $R^2$ via rotating and minimizing sum of $L_1$ distances
Given a set of points $x_1, \dots, x_n \in \mathbb{R}^2$, suppose one wants to find:
$\text{argmin}_i \sum\limits_{j=1}^{n} \lVert x_i - x_j\rVert_\infty$
i.e. the point which minimizes the sum of the ...
0
votes
0answers
21 views
Books on Lambda calculus
I would like to learn Lambda calculus (informally). What are the pre requisites for studying lambda calculus ? Can someone recommend an interesting textbook that introduces subject historically with ...
0
votes
0answers
16 views
Is there a uniform way of giving for any mathematical formula a hypercomputer that computes it?
Some mathematical formulas directly suggest an algorithm for computing it (even if sometimes an inefficient one).
For example, if we recursively define $\sum_{i=1}^nx_i=x_n+\sum_{i=1}^{n-1}x_i$, then ...
1
vote
0answers
11 views
Good exposition of tableau for first-order logic with equality?
I'm looking for a resource (online or printed) that explains in a self-contained way the classic tableau for first-order logic with equality. All I can find are expositions of tableaux for first-order ...
6
votes
1answer
92 views
Minimum set cover with incompatible sets
I'm interested in a variant of minimum set cover where some sets are ``incompatible'' (they can't be chosen simultaneously).
To state it more formally:
We have a finite base set $X$ and a family $\...
0
votes
0answers
19 views
Reference request: Learning runtime analysis (Complete material)
I am very curious about learning runtime analysis more than just what MIT courseware provides (The course with Erik Demaine 6.006) And what CLRS offers, which is a nice explanation about asymptotic ...
2
votes
1answer
48 views
Tight approximation for the chromatic number of an arbitrary graph in polynomial space and time
I am looking for an algorithm for approximating the chromatic number of an undirected simple graph with $n$ vertices in $O(n^{c_1})$ time and $O(n^{c_2})$ space, for some constants $c_1$ and $c_2$. ...
0
votes
0answers
15 views
What the the most efficient and effective VM ISA/computational model format backed by research?
The JVM and CLR are stack based machine are very efficient, mainly due to the investment in these platforms than an efficiency and effectiveness of stack based VMs.
For en entity that does not have ...
1
vote
0answers
23 views
Cloud computing application [closed]
Question
I want to analyze the potential of a cloud computing application that performs payroll and invoicing over the Internet from a large Internet company.I want also to describe the systems ...
0
votes
0answers
18 views
Extending the token bucket algorithm
I've been looking at implementing a local rate limiting solution satisfying certain guarantees. I've found surprisingly little literature on the extensions of the token bucket algorithm to hierarchies....
3
votes
0answers
18 views
Spanning hypertree which connects the vertices as slowly as possible
I want to find a reference for the following problem or a similar problem for my paper. I found a greedy algorithm for this problem, but writing such an algorithm in a paper is not common in my area, ...
3
votes
1answer
88 views
Is there a graph theory textbook that covers treewidth thoroughly?
Can someone recommend a graph theory textbook that covers treewidth thoroughly?
Something that focuses on the graph-theoretic structure of bounded treewidth graphs rather than solving problems on them....
1
vote
1answer
40 views
What is a task type?
I have an unlabeled dataset: 500 X-rays of seeds in husk. In each image there are different number of seeds, for instance, from $10$ to $50$.
A seed has some features. The main features are a seeds' ...
0
votes
0answers
17 views
Modern vs. original formulations of Rice's theorem
Rice's theorem states that any nontrivial semantic property of Turing machines is undecidable.
However, when I opened “Classes of recursively enumerable sets and their decision problems” by H. G. Rice,...
0
votes
1answer
26 views
Reference asking : High Performance Computer Architecture
Topics
Pipelining: Basic concepts, instruction and arithmetic pipeline, data hazards, control
hazards, and structural hazards, techniques for handling hazards. Exception handling.
Pipeline ...
1
vote
1answer
21 views
linear time nash equilibirum aproximations for two player zero sum games
I'm working on an AI for a game where I'd like the game where each player has hundreds of moves to select from and so the game matrix has 10s of thousands of entries. The game is however zero sum. ...
0
votes
0answers
11 views
Anthology of term indexing
I'm interested in finding the most appropriate analogy of a data structure to describe organization/access of genetic information in cells. We humans have 23 pairs of chromosomes - each pair ...
3
votes
0answers
59 views
bounding the height of stack when checking acceptance pushdown automaton
Let $A$ be a nondeterministic PDA (with empty stack acceptance). I am looking for a reference for a statement of the following form.
There exists a constant $c$, computable from $A$, such that:
if $w$...
1
vote
0answers
18 views
“Close” Graph Coloring?
I haven't been able to find whether this problem has been studied: we are given a graph $G$ and an ordered list of $k$ colors $L = [\ell_1, \cdots, \ell_k]$. Additionally, we are given a positive ...
0
votes
0answers
20 views
Distributed Serializable Snapshot Isolation
I was wondering if there is any research on distributed transaction algorithms for Serializable Snapshot Isolation. I found Binnig, C. et al.: Distributed snapshot isolation: global transactions pay ...
1
vote
1answer
32 views
Given a list of integer rectangle areas, find all integer rectangles that they can tile
Is there an efficient algorithm that takes in a list (multiset) of integer rectangle areas and finds all possible integer rectangle tilings?
Every integer rectangle area in the list (multiset) must be ...
0
votes
0answers
19 views
Textbooks about the verification of computer programs that use Z as the specification language
I'm looking for textbooks/lecture notes about the verification of computer programs, i.e. proving their correctness, that use Z as the specification language against which the correctness is verified.
1
vote
1answer
24 views
What is a good reference for NP hardness in the machine learning/optimization/operations research context?
I am reading some papers in machine learning and at the very beginning (introduction) you will see statements of theorems that says, for example:
Theorem 1.1. For any constant ϵ > 0, it is NP-hard ...
0
votes
1answer
40 views
Bottleneck TSP with repeated nodes
I am aware that the traveling salesman problem (TSP) and the bottleneck TSP problem is NP-hard for complete directed graphs. I am also aware that regular TSP that allows a path with repeating is also ...
0
votes
2answers
61 views
How to tell if a grammar is LALR(1) formally?
There is an “informal” definition of $\operatorname{LR}(k)$ (can be recognised by a parser that looks at $k$ symbols ahead) and a “formal” one (as a property of the set of rightmost derivations ...
2
votes
1answer
46 views
A voting scheme where votes are scriptable
I am looking for literature on mathematical models of (political) voting schemes. Concretely, I am interested in models that allow votes of the following form:
"I am voting for $X$, but only if $...
1
vote
2answers
94 views
Has category theory had an impact on computer science?
I've only learned bit of category theory, but so far its relation to type systems seems mostly descriptive. For example, you really don't need to know about coproducts to come up with the idea of ...
1
vote
0answers
15 views
Is there any research on allocating memory across multiple non-contiguous regions?
From my understanding, malloc and-the-like allocate contiguous blocks of memory. It then returns to you the start address of the memory block.
This (and other ...
0
votes
1answer
40 views
Algorithms that must compute a global property?
Could you give me examples of polynomial-time algorithms that must compute a global property over their entire input? A purely illustrative example of this might be a graph algorithm that somehow must ...
3
votes
0answers
57 views
Longest Path Problem on Graphs of Bounded Clique-Width
The wikipedia article mentions:
For graphs of bounded clique-width, the longest path can also be solved by a polynomial time dynamic programming algorithm.
However there are no references and I wasn'...
1
vote
1answer
81 views
Distributed predicate computation on event stream
My question is actually a request for papers, articles, texts or books on the problem that I'm trying to solve on my work.
I'm working on a program that computes a predicate value (true or false) for ...
0
votes
0answers
20 views
Books on scientific computing, efficent NN inference, and matrix multipication
I'm trying to learn more about how inference, matrix multiplication, and scientific computing (primarily with tensors/matrices). I'm not sure what the classics here are or what good sources are. I'm ...
0
votes
0answers
24 views
Strategies for event-driven concurrency
Is there any good formal investigation or at least definition of different strategies of event-driven concurrent programming?
I've read that there exist readiness based (pull based) and completion ...
2
votes
1answer
43 views
Error in pivot selection algorithm for merge phase [Sorting]
In the paper Comparison Based Sorting for Systems with Multiple GPUs, the authors describe the selection of a pivot element with respect to the partition on the first GPU (and its mirrored counterpart ...
1
vote
1answer
105 views
Reference for counting the number of paths in a DAG
Given a connected DAG I know how to compute the number of paths between two nodes. See e.g. Counting number of paths between two vertices in a DAG .
Is there a reference or name for the algorithm? ...
2
votes
1answer
39 views
Context free languages invariant by “shuffling” right hand side
Given a grammar $G$ for a Context Free language $L$, we can augment it by "shuffling" the right hand side of each production, e.g.:
$A \to BCD$ is expanded to $A \to BCD \; | \; BDC \; | \; ...
5
votes
1answer
68 views
Factoring algorithms after number field sieves
It seems that the General Number Field Sieve (GNFS) became number one and then RSA stopped its factoring challenges and there have been no advances in factoring algorithms besides quantum computers. ...
2
votes
0answers
48 views
Complexity of approximating a function value using queries
I am looking for information on problems of the following kind.
There is a function $f: [0,1] \to \mathbb{R}$ that is continuous and monotonically-increasing, with $f(0)<0$ and $f(1)>0$. You ...
2
votes
2answers
75 views
Is realization of unit disk graphs hard?
It is known that recognizing a unit disk graph is NP-hard [1].
However, the paper does not mention how hard the realization problem is.
I have looked up several references [2][3][4]. None of the ...
5
votes
1answer
61 views
Does big-Oh impose an ordered partition on the set of the “usual” functions?
The example in this answer proves the fact familiar to CS students - that the "big-O" is not a total order. However, most algorithm running times analyzed using big-Oh notation are not ...
3
votes
1answer
150 views
Functional Programming and Category Theory
I'm a math Ph.D. having done research in Algebraic Geometry and Algebraic Topology in grad school for my thesis and I've studied a fair amount of category theory in the process (e.g. having worked ...
4
votes
1answer
68 views
Algoritm to sample an even subgraph of a graph
In some problems related to the Ising model in physics and mathematics the following problem comes up:
Suppose I have a graph $G$. Then an even spanning subgraph of $G$ is a subgraph where you keep ...
3
votes
2answers
67 views
Books for the Mathematical Theory of AI/ML
I am interested in the mathematical foundations of Artificial Intelligence and Machine Learning. Are there any books which will describe and present the mathematical foundations in detail? I am not ...
4
votes
0answers
34 views
What are some advanced background topics I'll need for distributed systems and networks research?
I am a new graduate student in Computer Science who would like to be able to read and understand modern and new distributed systems research papers. My current background / courses and understanding ...
1
vote
0answers
109 views
Advanced Master Theorem?
I have learned the Master's Theorem from the CLRS textbook (2nd Edition), the form of the Master Theorem given in the above text is associated with the proof of each and every case. So at the end I ...
