Civil Rights
Movements, leaders, victories and the continuing fight for equality.
q2K BHP
Black History Portal
THE BHP WIRE —
HIDDEN TRUTHS
What's New!
Explore the people, places, events, achievements, struggles and stories that shaped our journey.
Movements, leaders, victories and the continuing fight for equality.
Innovation, patents, science, technology and world-changing contributions.
Pioneers, champions, Negro Leagues, records, activism and excellence.
Meet the people whose lives, choices and achievements shaped the journey.
Black towns, communities, institutions and places where history happened.
Moments that changed communities, movements, institutions and the nation.
In 1968 Shirley Chisholm became the first Black woman elected to the United States Congress. In 1972 she launched a campaign for the Democratic presidential nomination, breaking another political barrier.
MORE →Reflects the personal views, recollections, and perspective of the author, Mike Davis.
This is a personal recollection on the Move fire on May 13, 1985
In theoretical computer science, the word RAM (word random-access machine) model is a model of computation in which a random-access machine does arithmetic and bitwise operations on a word of w bits. Michael Fredman and Dan Willard created it in 1990 to simulate programming languages like C.[1]
The word RAM model is an abstract machine similar to a random-access machine, but with finite memory and word-length. It works with words of size up to w bits, meaning it can store integers up to . Because the model assumes that the word size matches the problem size, that is, for a problem of size n, , the word RAM model is a transdichotomous model.[2] The model allows both arithmetic operations and bitwise operations including logical shifts to be done in constant time (the precise instruction set assumed by an algorithm or proof using the model may vary).
In the word RAM model, integer sorting can be done fairly efficiently. Yijie Han and Mikkel Thorup created a randomized algorithm to sort integers in expected time of (in Big O notation) ,[3] while Han also created a deterministic variant with running time .[4]
The dynamic predecessor problem is also commonly analyzed in the word RAM model, and was the original motivation for the model. Dan Willard used y-fast tries to solve this in time, or, more precisely, where U is a bound on the values stored.[5] Michael Fredman and Willard also solved the problem using fusion trees in time.[1] Using exponential search trees, a query can be performed in .[6]
Additional results in the word RAM model are listed in the article on range searching.
Lower bounds applicable to word RAM algorithms are often proved in the cell-probe model.
Source: Wikipedia. Article content is retrieved live through the MediaWiki API.
In theoretical computer science, the word RAM (word random-access machine) model is a model of computation in which a random-access machine does arithmetic and bitwise operations on a word of w bits. Michael Fredman and Dan Willard created it in 1990 to simulate programming languages like C.
Ramberget (Swedish pronunciation: [ˈrâmːˌbærjɛt]; English: "Raven Hill") is a hill on Hisingen island in Gothenburg, Sweden. The surrounding area and park is called Keillers Park. Ramberget is a popular tourist attraction and a place for outdoor recreation for Gothenburg residents, with walking paths, lookouts over the city of Gothenburg and artworks. Ramberget's highest point 87 metres (282 ft) above sea level, with a lower second point called Ättestupan. There is a road for cars going to the top of Ramberget. The park is about 31 hectares. Ramberget got its characteristic shape already during the Ice Age 12,000 years ago. The northeast slope is flat while the south side has a higher cliff that is clearly visible from the river. The ice sheet has left traces both in the rock faces and through boulders in the area. Ramberget got its name of the old Swedish word "ram" which means raven. Ravens are still nesting on Ramberget. Until the early 1800s, when it wood was still widely used as fuel, there were no trees on Ramberget which instead was covered with heather, later replanting made the wood grow back and today there is a lush vegetation of beech, larch, pine and oaks. Most of the north shore of the river, including the area around Ramberget, was owned in the early 1900s by the Keiller family. Alexander Keiller, who came to Gothenburg from Scotland, had in the 1840s started a mechanical workshop that would later evolve into shipbuilding group Götaverken. During the recession of the 1860s, however, the company went into bankruptcy and after reorganization Alexander's son James Keiller begame the new manager. After some setbacks, including a severe fire in 1898, James decided to pull back and in 1906 he sold almost all of the business. At the same time he donated the area around Ramberget to the city, with the condition that the area should be used and remain as a natural park. The deed of gift is that only buildings that are "for the park's care or the visiting public homelike" may be erected, with the exception of water reservoirs. Keillers Park was designed in a National Romantic style, partly by Eugen Thorburn who also designed Kungsportsbron in central Gothenburg. The park was inaugurated Oct. 3, 1908. The Göteborg Mosque is located at the foot of Ramberget.
The Rāmnāmī Samāj (lit. 'Community of Ram the Renowned') is a Hindu sect founded by Sant Parasurām, in the 1890s, that worships Rama, a major deity in Hinduism. Living mainly in Chhattisgarh, its adherents tattoo the word "Ram" (Sanskrit: राम) on their bodies and wear shawls with the word "Ram" printed on it and headgear made of peacock feathers. Estimates of the group's population range from about 20,000 to more than 100,000.
In computational complexity theory, the 3SUM problem asks if a given set of n {\displaystyle n} real numbers contains three elements that sum to zero. A generalized version, k {\displaystyle k} -SUM, asks the same question on k {\displaystyle k} elements, rather than simply 3. 3SUM can be easily solved in O ( n 2 ) {\displaystyle O(n^{2})} time, and matching Ω ( n ⌈ k / 2 ⌉ ) {\displaystyle \Omega (n^{\lceil k/2\rceil })} lower bounds are known in some specialized models of computation (Erickson 1999). It was conjectured that any deterministic algorithm for the 3SUM requires Ω ( n 2 ) {\displaystyle \Omega (n^{2})} time. In 2014, the original 3SUM conjecture was refuted by Allan Grønlund and Seth Pettie who gave a deterministic algorithm that solves 3SUM in O ( n 2 / ( log n / log log n ) 2 / 3 ) {\displaystyle O(n^{2}/({\log n}/{\log \log n})^{2/3})} time. Additionally, Grønlund and Pettie showed that the 4-linear decision tree complexity of 3SUM is O ( n 3 / 2 log n ) {\displaystyle O(n^{3/2}{\sqrt {\log n}})} . These bounds were subsequently improved. In 2020 (improved on in 2026) the best known algorithm for 3SUM runs in O ( n 2 ( log log n ) O ( 1 ) / log 2 n ) {\displaystyle O(n^{2}(\log \log n)^{O(1)}/{\log ^{2}n})} time. Kane, Lovett, and Moran showed that the 6-linear decision tree complexity of 3SUM is O ( n log 2 n ) {\displaystyle O(n{\log ^{2}n})} . The latter bound is tight (up to a logarithmic factor). It was conjectured that 3SUM is unsolvable in O ( n 2 − Ω ( 1 ) ) {\displaystyle O(n^{2-\Omega (1)})} expected time, refuted in 2026. When the elements are integers in the range [ − N , … , N ] {\displaystyle [-N,\dots ,N]} , 3SUM can be solved in O ( n + N log N ) {\displaystyle O(n+N\log N)} time by representing the input set S {\displaystyle S} as a bit vector, computing the set S + S {\displaystyle S+S} of all pairwise sums as a discrete convolution using the fast Fourier transform, and finally comparing this set to S {\displaystyle S} . In an October 2026 preprint, Josh Alman and Virginia Vassilevska Williams reported a deterministic algorithm solving 3SUM on polynomially bounded integers in O ( n 1.9992 ) {\displaystyle O(n^{1.9992})} time in the word RAM model, and an algorithm solving 3SUM on real numbers in O ( n 1.998 ) {\displaystyle O(n^{1.998})} expected time in the real RAM model. The authors state that these results refute the integer and real-valued versions of the 3SUM conjecture (and refute other conjectures). The paper credits an internal research version of Claude with discovering the core algorithm (it also verified the paper’s main results using the Lean 4 proof assistant with the Mathlib library). Alman and Vassilevska Williams state that Anthropic shared a description of the algorithm with them, and compensated them for extending and writing up the results. The new result spurred more research. Days later on 12 October Ruhollah Majdoddin published a preprint with better bounds for 3SUM (and many other problems, such as related 3XOR) improving "both steps of their algorithm and obtain deterministic algorithms for 3SUM in O ( n 1.9945 + o ( 1 ) ) {\displaystyle O(n^{1.9945+o(1)})} time. .. also improve on the preprint's proof sketch for 3XOR and solve it deterministically in O ( n 1.99451 ) {\displaystyle O(n^{1.99451})} .. [the] paper was written with Anthropic’s Claude models, Claude Opus 5.5 and Claude Fable 5.1, through Claude Code, in October 2026. Under the author’s direction .. The Lean formalisation described in Section 22.2 was written in the same way. The author takes full responsibility for the content."
Before the 1921 destruction of Tulsa’s Greenwood District, Black residents had created a remarkable center of business and community life. The district included stores, professional offices, entertainment venues and homes owned by Black citizens. Understanding Greenwood means learning what was built—not only what was burned.
MORE →Brown v. Board of Education in 1954.
