Computer Science Stack Exchange

0

votes

0

answers

3

views

Finding the k-th baseball card purchased in an array of tuples with year and number of baseballs purchased in that year in O(n) time

algorithms time-complexity algorithm-analysis algorithm-design selection-problem

asked 25 mins ago Roman Bowling 1

0

votes

0

answers

18

views

What are the differences between Earliest Deadline First and Earliest Due Date?

computer-architecture scheduling cpu process-scheduling threads

modified 1 hour ago John L. 23.4k

0

votes

1

answer

31

views

Clear plan for self-study?

knowledge-representation

answered 2 hours ago FelixOuttaSpace 15

2

votes

1

answer

32

views

Maximization problem on finite collection of finite sets

algorithms complexity-theory optimization combinatorics

answered 3 hours ago Dmitry 391

0

votes

0

answers

21

views

Largest subarray with sum greater than K

arrays binary search

modified 4 hours ago Tijal 1

1

vote

0

answers

19

views

If factor isn't found in P-1 algorithm, should upper bound be increased linearly (i.e. +1)

algorithms discrete-mathematics factoring

asked 4 hours ago northerner 111

1

vote

1

answer

22

views

In the dataflow programming paradigm programs are modeled as directed graphs. Are the edges of the graph variables? And are the vertexes functions?

graphs programming-languages

modified 5 hours ago Sai Sreenivas 128

0

votes

0

answers

18

views

Scheduling jobs online on 3 identical machines - a lower bound of 5/3

algorithms scheduling online-algorithms competitive-ratio

modified 6 hours ago Felix 60

1

vote

1

answer

152

views

Can map-reduce speed up the count-min-sketch algorithm?

algorithms online-algorithms mapreduce

modified 6 hours ago Community♦ 1

1

vote

1

answer

63

views

Do there exist fast multiplication algorithms for two integers with one of them being static?

algorithms integers multiplication

modified 7 hours ago Community♦ 1

12

votes

5

answers

2k

views

Efficient algorithm to compute the $n$th Fibonacci number

algorithms time-complexity recurrence-relation

modified 8 hours ago Sumithrasenthilnathan 1

1

vote

1

answer

12

views

Proof for values of d with d:= ||L|| - N(L) with $d \in \mathbb{Z}$ and N(L) Nerode Index

formal-languages

answered 9 hours ago Yuval Filmus 229k

0

votes

1

answer

22

views

Convert the given NFA to DFA

regular-languages finite-automata regular-expressions

modified 10 hours ago Community♦ 1

0

votes

1

answer

16

views

If a grammar G is left and right regular, why $||L(G)|| \leq ||P||$?

formal-languages formal-grammars

answered 11 hours ago Yuval Filmus 229k

Jun	JUL	Aug
	21
2019	2020	2021

Stack Exchange Network

current community

your communities

more stack exchange communities

Explore our Questions

Finding the k-th baseball card purchased in an array of tuples with year and number of baseballs purchased in that year in O(n) time

What are the differences between Earliest Deadline First and Earliest Due Date?

Clear plan for self-study?

Maximization problem on finite collection of finite sets

Largest subarray with sum greater than K

If factor isn't found in P-1 algorithm, should upper bound be increased linearly (i.e. +1)

In the dataflow programming paradigm programs are modeled as directed graphs. Are the edges of the graph variables? And are the vertexes functions?

Scheduling jobs online on 3 identical machines - a lower bound of 5/3

Can map-reduce speed up the count-min-sketch algorithm?

Do there exist fast multiplication algorithms for two integers with one of them being static?

Efficient algorithm to compute the $n$th Fibonacci number

Proof for values of d with d:= ||L|| - N(L) with $d \in \mathbb{Z}$ and N(L) Nerode Index

Convert the given NFA to DFA

If a grammar G is left and right regular, why $||L(G)|| \leq ||P||$?

Hot Network Questions