Computer Science

Scholar

 Scholar
Ask a question and accept an answer.
Awarded 11490 times.
(Co)-induction, fixpoints and inference systems
Awarded yesterday
Is loading from L2 or L3 of multi level cache direct or require a transfer to L1
Awarded Nov 28 at 4:34
Fully Connected Graph to Lattice
Awarded Nov 27 at 11:26
$NL$ Leaf languages and $PSPACE$
Awarded Nov 27 at 4:55
Trouble Understanding Yao's "Basic Model" for Hashing
Awarded Nov 26 at 20:07
If Q* can break encryption would that prove P=NP?
Awarded Nov 25 at 23:42
optimal hamiltonian cycle in the Nearest Neighbor algorithm for the Traveling Salesman Problem
Awarded Nov 23 at 10:32
Choose elements from sets that form a permutation: NP hard?
Awarded Nov 22 at 8:56
How to find the free memory addresses in RAM?
Awarded Nov 21 at 17:51
Why does lexer has O(n) time complexity?
Awarded Nov 17 at 0:52
How to calculate the time complexity if the upper bound is decreasing as well?
Awarded Nov 16 at 17:43
Multithreaded quicksort
Awarded Nov 15 at 23:51
How to find prefixes and suffixes for infinite languages? (Automata)
Awarded Nov 15 at 22:41
Can an unreocognizable language be Turing-reducible to a recognizable language?
Awarded Nov 15 at 22:00
Are there any (theoretical-esque) computer science "competitions" at Undergrad level similar to Putnam?
Awarded Nov 15 at 10:01
Efficient solution for dominating set with two neighbors instead of one
Awarded Nov 15 at 3:31
Maximum reachable checkers on a checkerboard
Awarded Nov 14 at 20:27
Can this reccurrence recurrence be solved using Master Theorem?
Awarded Nov 14 at 14:02
Why exactly can Turing Machines implement all computations but computers can't?
Awarded Nov 14 at 7:08
What is the complexity of minimising a convex quadratic function over the integers?
Awarded Nov 14 at 6:17
Is L={0^n 1^n ∣n≥0} context free language?
Awarded Nov 13 at 16:27
How are pointers modeled on bit-based computer models?
Awarded Nov 9 at 21:42
Is there a known polynomial time complexity problem with bad constants?
Awarded Nov 9 at 21:42
Is there a model for the given logical formula, and if not, why?
Awarded Nov 8 at 5:35
Roles of 80386 MMU Paging Unit and similarity with modern CPU MMU
Awarded Nov 7 at 17:17
Is there an efficient algorithm for this ecommerce optimization problem?
Awarded Nov 7 at 4:08
Complexity of non-commutative range multiplication operation
Awarded Nov 5 at 17:11
How exactly does stale data appear in temporal buffer in Downfall attack?
Awarded Nov 4 at 18:06
Why Random Access Machine could only have $N \leq 2^{W}$ memory slots? Is it general theorem of informal rule?
Awarded Nov 4 at 14:57
Converting encrypted messages to unencrypted results of an equally hard to reverse function
Awarded Nov 2 at 23:08
Comparing Registers with 16-bits
Awarded Oct 30 at 9:33
(post deleted or otherwise unavailable)
Awarded Oct 30 at 3:56
Finding the error probability of a Monte Carlo algorithm
Awarded Oct 29 at 9:57
How can we find the number of pairs of intersecting ranges on a circular number line?
Awarded Oct 27 at 20:42
How do I multiply 2 signed 4 bit numbers in a logic circuit?
Awarded Oct 27 at 8:04
Computing the index of the n^{th} ancestor of a node in a perfect binary tree / heap
Awarded Oct 27 at 7:47
How does the program counter "know" when the fetch cycle is complete?
Awarded Oct 26 at 0:19
Prove $T(n)=10T(\frac{n}{3})+n\sqrt{n}=\Theta(n^{\lg_3{10}})$ using induction
Awarded Oct 26 at 0:03
Time complexity and content free evaluation
Awarded Oct 25 at 9:32
Find time complexity of $T(n)=3T(n-2)+O(n)$
Awarded Oct 25 at 6:47
Finding pairs of numbers in array whose reciprocals sum to 1
Awarded Oct 24 at 18:20
How to generate a degree sequence of a degree distribution
Awarded Oct 24 at 17:27
An elementary question about grammar
Awarded Oct 24 at 5:47
Let P be the language of palindromes over the alphabet Σ = {0, 1}. and let P‘ be the subset of the palindromes with different numbers of 0s and 1s
Awarded Oct 24 at 0:37
Finding the Point with Maximum Distance from the Boundary of a Closed Polygon in 2D Euclidean Space
Awarded Oct 23 at 15:55
What is the Minimum length of a string that is accepted by a DFA that shows that the language accepted by that DFA is infinite?
Awarded Oct 23 at 14:50
Construct a regular grammar that produces all possible strings of $\Sigma = \{a,b\}$ that do not contain substring 'abba'
Awarded Oct 20 at 19:12
Is (a*b) or (a*b)* star-free?
Awarded Oct 20 at 15:32
Data Structure for efficient nearest neighbor search using generalized distance?
Awarded Oct 19 at 16:18
Efficient intersection of multiple paths in a tree
Awarded Oct 18 at 10:36
Chordal graphs - what are the use cases?
Awarded Oct 16 at 17:50
Randomizing pairing in "gift swawp"
Awarded Oct 16 at 9:07
CSES problem Two Sets II
Awarded Oct 15 at 12:06
Abstract Interpretation: prove that the sign subtraction is increasing in each of its parameters
Awarded Oct 13 at 18:37
In a directed graph, efficiently determine node reached after traveling k edges from the starting node
Awarded Oct 7 at 20:47
Order in a subset
Awarded Oct 7 at 3:51
Complexity of zero-one loss vs logistic loss functions
Awarded Oct 6 at 2:57
Why when we use DMA , Read/Write operations on I/O devices are faster?
Awarded Oct 5 at 8:49
Why, for $f(n) = n \cdot \sqrt n$ and $g(n)=n^2/\log n$, we have $f(n) = o(g(n))$?
Awarded Oct 5 at 6:17
Quicksort with insertion sort
Awarded Oct 2 at 23:26
1
2 3 4 5
…
192

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.