72 reputation
6
bio website
location
age
visits member for 2 years, 10 months
seen Mar 2 at 22:01

Here is a sample of my work. I hope that it will prove useful... "Nothing has been accomplished if something remains to be done." (The Works of Gauss vol. 5, quot. from Worbs, 1955, p. 43)


Sep
24
awarded  Autobiographer
Mar
6
revised Solving recurrence $T(n) = T(\lceil n/2 \rceil) + T(\lfloor n/2 \rfloor) + \Theta(n)$
My edit was somehow revoked. I made it better, to conform to a comment I received. At least I hope so...
Mar
6
comment Solving recurrence $T(n) = T(\lceil n/2 \rceil) + T(\lfloor n/2 \rfloor) + \Theta(n)$
The statement of the Stack Overflow question that I referred to (and edited, by the way) refers to this material without giving the exact reference. It also contains additional relevant material. There are many questions about material in this book under this tag.
Mar
6
revised Using the substitution method for solving recurrences
The quotation from the book was incomplete. It appears as I wrote it on pages 83 and 84 of the third edition.
Mar
6
comment Solving recurrence $T(n) = T(\lceil n/2 \rceil) + T(\lfloor n/2 \rfloor) + \Theta(n)$
Thank you for the helpful comment. I hope that I have remedied the situation to your satisfaction.
Mar
6
revised Solving recurrence $T(n) = T(\lceil n/2 \rceil) + T(\lfloor n/2 \rfloor) + \Theta(n)$
I added a reference to Stack Overflow content, according to a suggestion made to me by a commenter.
Mar
6
suggested approved edit on Using the substitution method for solving recurrences
Mar
6
answered Solving recurrence $T(n) = T(\lceil n/2 \rceil) + T(\lfloor n/2 \rfloor) + \Theta(n)$
Mar
5
comment Solving recurrences of the form $T(n)=aT(n/a)+Θ(nlgn)$
Exercise 4.6.2 is very challenging. I might need hints in order to be able to solve it.
Mar
5
awarded  Student
Mar
4
asked Solving recurrences of the form $T(n)=aT(n/a)+Θ(nlgn)$
Mar
4
awarded  Excavator
Mar
4
revised how to solve the recurrence $T(n) = 2T(n/3) + n\log n$
Elements of the answer were present, but it could be made much clearer, so I completed the answer.
Mar
4
suggested approved edit on how to solve the recurrence $T(n) = 2T(n/3) + n\log n$
Mar
4
revised Recurrence - Master Theorem - Asymptotic Question
I added more explanations in order to make my point even clearer.
Mar
3
suggested rejected edit on Methods of solving a problem regarding withdrawing and depositing from a bank account.
Mar
3
revised Estimate the sample deviation in one pass
I added a reference to the paper written by the author of this method.
Mar
3
suggested approved edit on Estimate the sample deviation in one pass
Feb
28
revised Probability of two events
A completely revised answer, because the answer provided was wrong.
Feb
26
revised Convergence in law and uniformly integrability
I corrected the spelling because it was misleading.