Problem Detail: I’m reading Tracy Kidder’s “The Soul of a New Machine” where a team at Data General design a new machine (codenamed “Eagle”, later named MV/8000). It is 32-bit extension of a previous architecture (the 16-bit Eclipse). One of the Read More …
Category: Uncategorized
[Solved]: Using the Master theorem on a recurrence with non-constant a
Problem Detail: I am trying to solve the following equation using master’s theorem. $T(n) = 3^n T(frac{n} 3) + O(1)$ Extracting the b and $f(n)$ values makes sense they are $b=3$ and $f(n)=1$. I am not sure what my $a$ value Read More …
[Solved]: Expected number of random interval flips needed for sorting a random array
Problem Detail: This question is inspired by the Bogo-Sort algorithm and the discussion of whether there are any worse sorting algorithms than Bogosort. Assume that $A$ is an array initialized by a random permutation on the set $I_n={1,2,ldots, n}$. Consider the Read More …
[Solved]: What is the difference between “for infinitely many n” and “for all n”?
Problem Detail: I have read some complexity papers in which “for infinitely many input sizes” is used. What is the difference in the computational complexity context between “for infinitely many input sizes” and “for all input sizes”? Asked By : Jose Antonio Read More …
[Solved]: Some questions regarding compilers and assemblers
Problem Detail: Lots of basic questions are there in my mind. I need to clear them. Statement 1: A compiler converts a human-readable codes to object codes, and those are converted to a machine code (executable) by linker. Am I right Read More …
[Solved]: per-record timeline consistency vs. monotonic writes
Problem Detail: It seems to me that the per-record timeline consistency as defined by Cooper et al. in “PNUTS: Yahoo!’s Hosted Data Serving Platform” mimics the (older?) definition of monotonic writes. From the paper: per-record timeline consistency: all replicas of a Read More …
[Solved]: Efficient bandwidth algorithm
Problem Detail: Recently I sort of stumbled on a problem of finding an efficient topology given a weighted directed graph. Consider the following scenario: Node 1 is connected to 2,3,4 at 50 Mbps. Node 1 has 100 Mbps network card. Node Read More …
[Solved]: Counting the nodes in a network in a distributed way
Problem Detail: There is a network with $n$ nodes. Each node can contact only the neighbouring nodes (the degree of each node is bounded, if that matters). One of the nodes, say $s$, wants to know $n$. How can it do Read More …
[Solved]: Getting started with Program Analysis
Problem Detail: I’m looking for resources on getting started with program analysis. The only book I’ve found on the topic is the Nielson & Nielson book. Other than that, it seems like there are only “compiler” books where “program analysis” would Read More …
[Solved]: Approximation of minimum bandwidth on binary trees
Problem Detail: Minimum bandwidth problem is to a find an ordering of graph nodes on integer line that minimizes the largest distance between any two adjacent nodes. The decision problem is NP-complete even for binary trees. Complexity Results for Bandwidth Minimization. Read More …
