Pau Gasol Sáez is a Spanish professional basketball player. He is a six-time NBA All-Star and a four-time All-NBA selection, twice on the second team and twice on the third team. Gasol has won two NBA championships, both with the Los Angeles Lakers, he was the NBA Rookie of the Year in 2002 with the Memphis Grizzlies, being the first non-American player to have won that award. He is the older brother of fellow NBA player Marc Gasol. Gasol was selected by the Atlanta Hawks with the third overall pick in the first round of the 2001 NBA draft, but his rights were traded to the Memphis Grizzlies, he holds the Grizzlies' franchise record for free throws made and attempted. Following more than six seasons with Memphis, Gasol played for the Los Angeles Lakers, the Chicago Bulls, the San Antonio Spurs, the Milwaukee Bucks. Internationally, Gasol has won two Olympic silver medals, an Olympic bronze medal, a FIBA World Cup title, three EuroBasket titles with the Spanish national basketball team. Pau Gasol was born in Barcelona.

His parents both played basketball in organized leagues. His father, stood 6 feet 3 inches, his mother, was 6 feet 1 inch. Gasol began playing basketball as a center with his school team, he signed with Cornellà; when he was sixteen, he began playing for Barcelona's junior team. He won both the 1998 Albert Schweitzer Tournament and the 1998 FIBA Europe Under-18 Championship. After moving to the senior team of Barcelona, Gasol played just 25 total minutes in the Spanish ACB League's 1998–99 season, averaged 13.7 minutes per game in the ACB the next year. However, in his final season in the ACB, Gasol averaged 12.4 points and 5.8 rebounds in 24.7 minutes per game. Barcelona was victorious in the Spanish National Cup finals championship game in 2001, Gasol was named Most Valuable Player. After entering the NBA draft, Gasol was selected third overall in the first round in the 2001 NBA draft by the Atlanta Hawks, who traded his draft rights to the Memphis Grizzlies in exchange for Shareef Abdur-Rahim.

In his first season with the Grizzlies, Gasol became the first foreign player to win the NBA Rookie of the Year Award, was named to the NBA All-Rookie First Team. He averaged 17.6 points and 8.9 rebounds per game, was the only team member to play in all 82 games that season. Gasol led the team in scoring in his second year with the Grizzlies, for the second year in a row, played in all 82 games. Gasol missed the first game of his career, during his third year, with a foot injury on April 5, 2004, which snapped his string of 240 consecutive games played, he grabbed the 1,500th rebound of his career on November 12, 2003, against the Orlando Magic and scored his 3,000th career point on October 31, 2003, against the Boston Celtics. Despite having 22 points in Game 4 against the San Antonio Spurs, the highest by a Memphis players in the playoffs, his team was eliminated in the first round, not winning a single game against San Antonio; this was both the Gasol's first trip to the NBA Playoffs. He scored 31 points and blocked four shots on January 11, 2005, against the Indiana Pacers to earn 5,000 points and 500 blocks in his career, becoming the 10th fastest player to reach 5,000 points/500 blocks since 1973–74.

He helped his team make it to the playoffs for the second time in his career, but they were eliminated in the first round and did not win a single game against the Phoenix Suns. In his fifth year with the Grizzlies, he became the franchise's all-time leading rebounder on March 24 against the New York Knicks when he grabbed his 3,072nd rebound in a Grizzlies uniform, he made 29 consecutive free throw attempts from January 24 to 28, tying the second best mark in Grizzlies history, including two straight games going 12–12 from the line, tying the best single-game mark in franchise history. Gasol and the Grizzlies returned to the playoffs for the third time in his team's history. Once again, they were eliminated in the first round and did not win a single game against the Dallas Mavericks. On February 9, 2006, making his first appearance, Gasol was selected to play in the 2006 NBA All-Star Game in Houston, Texas as a reserve center for the Western Conference. At the time, he was one of four players ranked among Western Conference forwards in the top ten in points, rebounds and blocked shots.

He was the first Spanish basketball player as well as the first Grizzlies player to make it to the All-Star Game. Gasol missed the first 23 games of the 2006–07 NBA season due to a broken foot suffered near the end of Spain's semifinal win over Argentina in the 2006 FIBA World Championship, he would go on to be named Most Valuable Player of the tournament. He had a season-high 34 points, eight rebounds and tied a career-high and franchise record with eight blocks on January 29 against the Sacramento Kings, surpassed Shareef Abdur-Rahim as the franchise's all-time leader in free throw attempts on January 31 against the Dallas Mavericks, he became the all-time franchise leader in field goals made on February 6 against the Houston Rockets, became the all-time franchise leader in minutes played on February 7 at Dallas. He surpassed Shareef Abdur-Rahim as the Grizzlies' all-time leading scorer on March 7, 2007, against the Toronto Raptors. On January 24, 2007, Gasol recorded his second career triple-double against the hosting Utah Jazz, garnering 17 points, 13 rebounds, 12 assists.

He registered 2 blocks and one steal. On February 1, 2008, Memphis traded Gasol to the

Mary–Ann Eisel is an American former tennis player. She was the US Open mixed doubles champion in 1968. Eisel was born in St. Louis and was educated in the Ladue School District, went on to Washington University in St. Louis. In 1969, she married fellow tennis player Peter Curtis, her Mixed Doubles partner. Following their divorce, she married Don Beattie on May 12, 1972. In addition to her tennis career, Eisel was a talented amateur golfer. Eisel reached the finals of the 1967 women's doubles U. S. National Championships at Forrest Hills with Donna Floyd but lost in three sets against Rosemary Casals and Billie Jean King. In 1968 she won the US Open mixed doubles title with Peter Curtis by defeating Tory Fretz and Gerry Perry in straight sets. In 1969 she won the singles title at the Surrey Grass Court Championships, defeating Judy Tegart in three sets, she won the doubles title at the 1971 British Hard Court Championships with Françoise Dürr, defeating Margaret Court and Evonne Goolagong in the final.

In 1968 and 1970 she played for the US Federation Cup team, reaching the semifinals of the World Group on both occasions, compiled a record of five wins and four losses. In 1974, she was a team member of the Detroit Loves, which won the Central Section Championship in the inaugural season of the newly created World Team Tennis league in the United States; the following year, 1975, she played for the Hawaii Leis. Mary-Ann Eisel at the Women's Tennis Association Mary-Ann Eisel at the International Tennis Federation Mary-Ann Eisel at the Fed Cup

Algorithm engineering focuses on the design, implementation, optimization and experimental evaluation of computer algorithms, bridging the gap between algorithm theory and practical applications of algorithms in software engineering. It is a general methodology for algorithmic research. In 1995, a report from an NSF-sponsored workshop "with the purpose of assessing the current goals and directions of the Theory of Computing community" identified the slow speed of adoption of theoretical insights by practitioners as an important issue and suggested measures to reduce the uncertainty by practitioners whether a certain theoretical breakthrough will translate into practical gains in their field of work, tackle the lack of ready-to-use algorithm libraries, which provide stable, bug-free and well-tested implementations for algorithmic problems and expose an easy-to-use interface for library consumers, but promising algorithmic approaches have been neglected due to difficulties in mathematical analysis.

The term "algorithm engineering" was first used with specificity in 1997, with the first Workshop on Algorithm Engineering, organized by Giuseppe F. Italiano. Algorithm engineering does not intend to replace or compete with algorithm theory, but tries to enrich and reinforce its formal approaches with experimental algorithmics; this way it can provide new insights into the efficiency and performance of algorithms in cases where the algorithm at hand is less amenable to algorithm theoretic analysis, formal analysis pessimistically suggests bounds which are unlikely to appear on inputs of practical interest, the algorithm relies on the intricacies of modern hardware architectures like data locality, branch prediction, instruction stalls, instruction latencies which the machine model used in Algorithm Theory is unable to capture in the required detail, the crossover between competing algorithms with different constant costs and asymptotic behaviors needs to be determined. Some researchers describe algorithm engineering's methodology as a cycle consisting of algorithm design, analysis and experimental evaluation, joined by further aspects like machine models or realistic inputs.

They argue that equating algorithm engineering with experimental algorithmics is too limited, because viewing design and analysis and experimentation as separate activities ignores the crucial feedback loop between those elements of algorithm engineering. While specific applications are outside the methodology of algorithm engineering, they play an important role in shaping realistic models of the problem and the underlying machine, supply real inputs and other design parameters for experiments. Compared to algorithm theory, which focuses on the asymptotic behavior of algorithms, algorithm engineers need to keep further requirements in mind: Simplicity of the algorithm, implementability in programming languages on real hardware, allowing code reuse. Additionally, constant factors of algorithms have such a considerable impact on real-world inputs that sometimes an algorithm with worse asymptotic behavior performs better in practice due to lower constant factors; some problems can be solved with heuristics and randomized algorithms in a simpler and more efficient fashion than with deterministic algorithms.

This makes simple randomized algorithms difficult to analyze because there are subtle dependencies to be taken into account. Huge semantic gaps between theoretical insights, formulated algorithms, programming languages and hardware pose a challenge to efficient implementations of simple algorithms, because small implementation details can have rippling effects on execution behavior; the only reliable way to compare several implementations of an algorithm is to spend an considerable amount of time on tuning and profiling, running those algorithms on multiple architectures, looking at the generated machine code. See: Experimental algorithmics Implementations of algorithms used for experiments differ in significant ways from code usable in applications. While the former prioritizes fast prototyping and instrumentation for measurements during experiments, the latter requires thorough testing, maintainability and tuning for particular classes of inputs. Stable, well-tested algorithm libraries like LEDA play an important role in technology transfer by speeding up the adoption of new algorithms in applications.

Such libraries reduce the required investment and risk for practitioners, because it removes the burden of understanding and implementing the results of academic research. Two main conferences on Algorithm Engineering are organized annually, namely: Symposium on Experimental Algorithms, established in 1997. SIAM Meeting on Algorithm Engineering and Experiments, established in 1999; the 1997 Workshop on Algorithm Engineering was held in Venice on September 11–13, 1997. The Third International Workshop on Algorithm Engineering was held in London, UK in July 1999; the first Workshop on Algorithm Engineering and Experimentation was held in Baltimore, Maryland on January 15–16, 1999. It was sponsored by DIMACS, the Center for Discrete Mathematics and Theoretical Computer Science, with additional support from SIGACT, the ACM Special Interest Group on Algorithms and Computation Theory, SIAM, the Society for Industrial and Applied Mathematics