Fundamental Problems in Computing Essays in Honor of Professor Daniel J. Rosenkrantz

Gespeichert in:
Bibliographische Detailangaben
Weitere Verfasser: Ravi, Sekharipuram S. (HerausgeberIn), Shukla, Sandeep Kumar (HerausgeberIn)
Format: Elektronisch E-Book
Sprache:English
Veröffentlicht: Dordrecht Springer Netherlands 2009
Ausgabe:1st ed. 2009
Schlagworte:
Online-Zugang:DE-355
URL des Erstveröffentlichers
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!

MARC

LEADER 00000nam a2200000zc 4500
001 BV050122704
003 DE-604
007 cr|uuu---uuuuu
008 250115s2009 xx o|||| 00||| eng d
020 |a 9781402096884  |9 978-1-4020-9688-4 
024 7 |a 10.1007/978-1-4020-9688-4  |2 doi 
035 |a (ZDB-2-SCS)978-1-4020-9688-4 
035 |a (DE-599)BVBBV050122704 
040 |a DE-604  |b ger  |e rda 
041 0 |a eng 
049 |a DE-355 
082 0 |a 005.45  |2 23 
245 1 0 |a Fundamental Problems in Computing  |b Essays in Honor of Professor Daniel J. Rosenkrantz  |c edited by Sekharipuram S. Ravi, Sandeep Kumar Shukla 
250 |a 1st ed. 2009 
264 1 |a Dordrecht  |b Springer Netherlands  |c 2009 
300 |a 1 Online-Ressource (XXII, 516 Seiten) 
336 |b txt  |2 rdacontent 
337 |b c  |2 rdamedia 
338 |b cr  |2 rdacarrier 
505 8 |a Fundamental Problems in Computing is in honor of Professor Daniel J. Rosenkrantz, a distinguished researcher in Computer Science. Professor Rosenkrantz has made seminal contributions to many subareas of Computer Science including formal languages and compilers, automata theory, algorithms, database systems, very large scale integrated systems, fault-tolerant computing and discrete dynamical systems. For many years, Professor Rosenkrantz served as the Editor-in-Chief of the Journal of the Association for Computing Machinery (JACM), a very prestigious archival journal in Computer Science. His contributions to Computer Science have earned him many awards including the Fellowship from ACM and the ACM SIGMOD Contributions Award. Professor Christopher L. Barrett (Virginia Tech, Blacksburg, VA): "Professor Rosenkrantz has produced numerous seminal results in formal languages, algorithmic complexity and databases over the course of his career. 
505 8 |a From his 1967 context-free grammars paper to his recent work on dynamical systems, he has provided the computer science community with a wonderful collection of results which are of theoretical and practical importance. This book is a very appropriate attempt by the community to honor his vision and thank him." Professor Zvi Kedem (New York University, New York, NY): "Many of Dan's publications have informed and inspired research in several areas of Computer Science. My own work on concurrency control was influenced by his seminal contributions to that area. This volume, containing a number of Dan's best papers and contributed chapters by well-known researchers, is a fitting tribute to a truly distinguished researcher." Professor R. 
505 8 |a Ravi (Carnegie-Mellon University, Pittsburgh, PA): "Professor Rosenkrantz's work has touched upon fundamental and practical issues in all aspects of theoretical computer science including canonical formsfor grammars, very early worst-case analysis of TSP heuristics, characterizing serializability and consistency in concurrent databases, new models and algorithms for hierarchically specified data and mining time series data. The scope and depth of Dan's invaluable contributions to Computer Science are captured in this volume." Professor Jeffrey Ullman (Stanford University, Stanford, CA): "I have known Dan since the year before we entered Columbia Engineering School as freshmen. His work has been a model for how one uses theoretical skills to make an impact on real problems, and I wish him well in his retirement." Professor Moshe Vardi (Rice University, Houston, TX): "Dan Rosenkrantz's career spans over 40 years of designing and analyzing algorithms. 
505 8 |a Unlike many other algorithms researchers, Dan has always sought algorithms in their native application domains, in compilers, in concurrency control, in network design, in query evaluation, and in many more areas. We learn from him that algorithm design and analysis is one of the most fundamental activities in computer science." 
650 4 |a Compilers and Interpreters 
650 4 |a Computer System Implementation 
650 4 |a Formal Languages and Automata Theory 
650 4 |a Logic Design 
650 4 |a Compilers (Computer programs) 
650 4 |a Computer systems 
650 4 |a Machine theory 
650 4 |a Logic design 
700 1 |a Ravi, Sekharipuram S.  |4 edt 
700 1 |a Shukla, Sandeep Kumar  |4 edt 
776 0 8 |i Erscheint auch als  |n Druck-Ausgabe  |z 9781402096877 
776 0 8 |i Erscheint auch als  |n Druck-Ausgabe  |z 9781402097645 
776 0 8 |i Erscheint auch als  |n Druck-Ausgabe  |z 9789048181834 
856 4 0 |u https://doi.org/10.1007/978-1-4020-9688-4  |x Verlag  |z URL des Erstveröffentlichers  |3 Volltext 
912 |a ZDB-1-SCS 
940 1 |q ZDB-2-SCS_2009 
943 1 |a oai:aleph.bib-bvb.de:BVB01-035459574 
966 e |u https://doi.org/10.1007/978-1-4020-9688-4  |l DE-355  |p ZDB-2-SCS  |q UBR Paketkauf 2024  |x Verlag  |3 Volltext 

Datensatz im Suchindex

_version_ 1822468307817594880
adam_text
any_adam_object
author2 Ravi, Sekharipuram S.
Shukla, Sandeep Kumar
author2_role edt
edt
author2_variant s s r ss ssr
s k s sk sks
author_facet Ravi, Sekharipuram S.
Shukla, Sandeep Kumar
building Verbundindex
bvnumber BV050122704
collection ZDB-1-SCS
contents Fundamental Problems in Computing is in honor of Professor Daniel J. Rosenkrantz, a distinguished researcher in Computer Science. Professor Rosenkrantz has made seminal contributions to many subareas of Computer Science including formal languages and compilers, automata theory, algorithms, database systems, very large scale integrated systems, fault-tolerant computing and discrete dynamical systems. For many years, Professor Rosenkrantz served as the Editor-in-Chief of the Journal of the Association for Computing Machinery (JACM), a very prestigious archival journal in Computer Science. His contributions to Computer Science have earned him many awards including the Fellowship from ACM and the ACM SIGMOD Contributions Award. Professor Christopher L. Barrett (Virginia Tech, Blacksburg, VA): "Professor Rosenkrantz has produced numerous seminal results in formal languages, algorithmic complexity and databases over the course of his career.
From his 1967 context-free grammars paper to his recent work on dynamical systems, he has provided the computer science community with a wonderful collection of results which are of theoretical and practical importance. This book is a very appropriate attempt by the community to honor his vision and thank him." Professor Zvi Kedem (New York University, New York, NY): "Many of Dan's publications have informed and inspired research in several areas of Computer Science. My own work on concurrency control was influenced by his seminal contributions to that area. This volume, containing a number of Dan's best papers and contributed chapters by well-known researchers, is a fitting tribute to a truly distinguished researcher." Professor R.
Ravi (Carnegie-Mellon University, Pittsburgh, PA): "Professor Rosenkrantz's work has touched upon fundamental and practical issues in all aspects of theoretical computer science including canonical formsfor grammars, very early worst-case analysis of TSP heuristics, characterizing serializability and consistency in concurrent databases, new models and algorithms for hierarchically specified data and mining time series data. The scope and depth of Dan's invaluable contributions to Computer Science are captured in this volume." Professor Jeffrey Ullman (Stanford University, Stanford, CA): "I have known Dan since the year before we entered Columbia Engineering School as freshmen. His work has been a model for how one uses theoretical skills to make an impact on real problems, and I wish him well in his retirement." Professor Moshe Vardi (Rice University, Houston, TX): "Dan Rosenkrantz's career spans over 40 years of designing and analyzing algorithms.
Unlike many other algorithms researchers, Dan has always sought algorithms in their native application domains, in compilers, in concurrency control, in network design, in query evaluation, and in many more areas. We learn from him that algorithm design and analysis is one of the most fundamental activities in computer science."
ctrlnum (ZDB-2-SCS)978-1-4020-9688-4
(DE-599)BVBBV050122704
dewey-full 005.45
dewey-hundreds 000 - Computer science, information, general works
dewey-ones 005 - Computer programming, programs, data, security
dewey-raw 005.45
dewey-search 005.45
dewey-sort 15.45
dewey-tens 000 - Computer science, information, general works
discipline Informatik
doi_str_mv 10.1007/978-1-4020-9688-4
edition 1st ed. 2009
format Electronic
eBook
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000zc 4500</leader><controlfield tag="001">BV050122704</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">250115s2009 xx o|||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781402096884</subfield><subfield code="9">978-1-4020-9688-4</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4020-9688-4</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SCS)978-1-4020-9688-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV050122704</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-355</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.45</subfield><subfield code="2">23</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Fundamental Problems in Computing</subfield><subfield code="b">Essays in Honor of Professor Daniel J. Rosenkrantz</subfield><subfield code="c">edited by Sekharipuram S. Ravi, Sandeep Kumar Shukla</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed. 2009</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Dordrecht</subfield><subfield code="b">Springer Netherlands</subfield><subfield code="c">2009</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XXII, 516 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Fundamental Problems in Computing is in honor of Professor Daniel J. Rosenkrantz, a distinguished researcher in Computer Science. Professor Rosenkrantz has made seminal contributions to many subareas of Computer Science including formal languages and compilers, automata theory, algorithms, database systems, very large scale integrated systems, fault-tolerant computing and discrete dynamical systems. For many years, Professor Rosenkrantz served as the Editor-in-Chief of the Journal of the Association for Computing Machinery (JACM), a very prestigious archival journal in Computer Science. His contributions to Computer Science have earned him many awards including the Fellowship from ACM and the ACM SIGMOD Contributions Award. Professor Christopher L. Barrett (Virginia Tech, Blacksburg, VA): "Professor Rosenkrantz has produced numerous seminal results in formal languages, algorithmic complexity and databases over the course of his career.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">From his 1967 context-free grammars paper to his recent work on dynamical systems, he has provided the computer science community with a wonderful collection of results which are of theoretical and practical importance. This book is a very appropriate attempt by the community to honor his vision and thank him." Professor Zvi Kedem (New York University, New York, NY): "Many of Dan's publications have informed and inspired research in several areas of Computer Science. My own work on concurrency control was influenced by his seminal contributions to that area. This volume, containing a number of Dan's best papers and contributed chapters by well-known researchers, is a fitting tribute to a truly distinguished researcher." Professor R.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Ravi (Carnegie-Mellon University, Pittsburgh, PA): "Professor Rosenkrantz's work has touched upon fundamental and practical issues in all aspects of theoretical computer science including canonical formsfor grammars, very early worst-case analysis of TSP heuristics, characterizing serializability and consistency in concurrent databases, new models and algorithms for hierarchically specified data and mining time series data. The scope and depth of Dan's invaluable contributions to Computer Science are captured in this volume." Professor Jeffrey Ullman (Stanford University, Stanford, CA): "I have known Dan since the year before we entered Columbia Engineering School as freshmen. His work has been a model for how one uses theoretical skills to make an impact on real problems, and I wish him well in his retirement." Professor Moshe Vardi (Rice University, Houston, TX): "Dan Rosenkrantz's career spans over 40 years of designing and analyzing algorithms.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Unlike many other algorithms researchers, Dan has always sought algorithms in their native application domains, in compilers, in concurrency control, in network design, in query evaluation, and in many more areas. We learn from him that algorithm design and analysis is one of the most fundamental activities in computer science."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Compilers and Interpreters</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer System Implementation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Formal Languages and Automata Theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic Design</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Compilers (Computer programs)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer systems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machine theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic design</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ravi, Sekharipuram S.</subfield><subfield code="4">edt</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shukla, Sandeep Kumar</subfield><subfield code="4">edt</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781402096877</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781402097645</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9789048181834</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4020-9688-4</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-SCS</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SCS_2009</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-035459574</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-1-4020-9688-4</subfield><subfield code="l">DE-355</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="q">UBR Paketkauf 2024</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection>
id DE-604.BV050122704
illustrated Not Illustrated
indexdate 2025-01-28T05:13:37Z
institution BVB
isbn 9781402096884
language English
oai_aleph_id oai:aleph.bib-bvb.de:BVB01-035459574
open_access_boolean
owner DE-355
DE-BY-UBR
owner_facet DE-355
DE-BY-UBR
physical 1 Online-Ressource (XXII, 516 Seiten)
psigel ZDB-1-SCS
ZDB-2-SCS_2009
ZDB-2-SCS UBR Paketkauf 2024
publishDate 2009
publishDateSearch 2009
publishDateSort 2009
publisher Springer Netherlands
record_format marc
spelling Fundamental Problems in Computing Essays in Honor of Professor Daniel J. Rosenkrantz edited by Sekharipuram S. Ravi, Sandeep Kumar Shukla
1st ed. 2009
Dordrecht Springer Netherlands 2009
1 Online-Ressource (XXII, 516 Seiten)
txt rdacontent
c rdamedia
cr rdacarrier
Fundamental Problems in Computing is in honor of Professor Daniel J. Rosenkrantz, a distinguished researcher in Computer Science. Professor Rosenkrantz has made seminal contributions to many subareas of Computer Science including formal languages and compilers, automata theory, algorithms, database systems, very large scale integrated systems, fault-tolerant computing and discrete dynamical systems. For many years, Professor Rosenkrantz served as the Editor-in-Chief of the Journal of the Association for Computing Machinery (JACM), a very prestigious archival journal in Computer Science. His contributions to Computer Science have earned him many awards including the Fellowship from ACM and the ACM SIGMOD Contributions Award. Professor Christopher L. Barrett (Virginia Tech, Blacksburg, VA): "Professor Rosenkrantz has produced numerous seminal results in formal languages, algorithmic complexity and databases over the course of his career.
From his 1967 context-free grammars paper to his recent work on dynamical systems, he has provided the computer science community with a wonderful collection of results which are of theoretical and practical importance. This book is a very appropriate attempt by the community to honor his vision and thank him." Professor Zvi Kedem (New York University, New York, NY): "Many of Dan's publications have informed and inspired research in several areas of Computer Science. My own work on concurrency control was influenced by his seminal contributions to that area. This volume, containing a number of Dan's best papers and contributed chapters by well-known researchers, is a fitting tribute to a truly distinguished researcher." Professor R.
Ravi (Carnegie-Mellon University, Pittsburgh, PA): "Professor Rosenkrantz's work has touched upon fundamental and practical issues in all aspects of theoretical computer science including canonical formsfor grammars, very early worst-case analysis of TSP heuristics, characterizing serializability and consistency in concurrent databases, new models and algorithms for hierarchically specified data and mining time series data. The scope and depth of Dan's invaluable contributions to Computer Science are captured in this volume." Professor Jeffrey Ullman (Stanford University, Stanford, CA): "I have known Dan since the year before we entered Columbia Engineering School as freshmen. His work has been a model for how one uses theoretical skills to make an impact on real problems, and I wish him well in his retirement." Professor Moshe Vardi (Rice University, Houston, TX): "Dan Rosenkrantz's career spans over 40 years of designing and analyzing algorithms.
Unlike many other algorithms researchers, Dan has always sought algorithms in their native application domains, in compilers, in concurrency control, in network design, in query evaluation, and in many more areas. We learn from him that algorithm design and analysis is one of the most fundamental activities in computer science."
Compilers and Interpreters
Computer System Implementation
Formal Languages and Automata Theory
Logic Design
Compilers (Computer programs)
Computer systems
Machine theory
Logic design
Ravi, Sekharipuram S. edt
Shukla, Sandeep Kumar edt
Erscheint auch als Druck-Ausgabe 9781402096877
Erscheint auch als Druck-Ausgabe 9781402097645
Erscheint auch als Druck-Ausgabe 9789048181834
https://doi.org/10.1007/978-1-4020-9688-4 Verlag URL des Erstveröffentlichers Volltext
spellingShingle Fundamental Problems in Computing Essays in Honor of Professor Daniel J. Rosenkrantz
Fundamental Problems in Computing is in honor of Professor Daniel J. Rosenkrantz, a distinguished researcher in Computer Science. Professor Rosenkrantz has made seminal contributions to many subareas of Computer Science including formal languages and compilers, automata theory, algorithms, database systems, very large scale integrated systems, fault-tolerant computing and discrete dynamical systems. For many years, Professor Rosenkrantz served as the Editor-in-Chief of the Journal of the Association for Computing Machinery (JACM), a very prestigious archival journal in Computer Science. His contributions to Computer Science have earned him many awards including the Fellowship from ACM and the ACM SIGMOD Contributions Award. Professor Christopher L. Barrett (Virginia Tech, Blacksburg, VA): "Professor Rosenkrantz has produced numerous seminal results in formal languages, algorithmic complexity and databases over the course of his career.
From his 1967 context-free grammars paper to his recent work on dynamical systems, he has provided the computer science community with a wonderful collection of results which are of theoretical and practical importance. This book is a very appropriate attempt by the community to honor his vision and thank him." Professor Zvi Kedem (New York University, New York, NY): "Many of Dan's publications have informed and inspired research in several areas of Computer Science. My own work on concurrency control was influenced by his seminal contributions to that area. This volume, containing a number of Dan's best papers and contributed chapters by well-known researchers, is a fitting tribute to a truly distinguished researcher." Professor R.
Ravi (Carnegie-Mellon University, Pittsburgh, PA): "Professor Rosenkrantz's work has touched upon fundamental and practical issues in all aspects of theoretical computer science including canonical formsfor grammars, very early worst-case analysis of TSP heuristics, characterizing serializability and consistency in concurrent databases, new models and algorithms for hierarchically specified data and mining time series data. The scope and depth of Dan's invaluable contributions to Computer Science are captured in this volume." Professor Jeffrey Ullman (Stanford University, Stanford, CA): "I have known Dan since the year before we entered Columbia Engineering School as freshmen. His work has been a model for how one uses theoretical skills to make an impact on real problems, and I wish him well in his retirement." Professor Moshe Vardi (Rice University, Houston, TX): "Dan Rosenkrantz's career spans over 40 years of designing and analyzing algorithms.
Unlike many other algorithms researchers, Dan has always sought algorithms in their native application domains, in compilers, in concurrency control, in network design, in query evaluation, and in many more areas. We learn from him that algorithm design and analysis is one of the most fundamental activities in computer science."
Compilers and Interpreters
Computer System Implementation
Formal Languages and Automata Theory
Logic Design
Compilers (Computer programs)
Computer systems
Machine theory
Logic design
title Fundamental Problems in Computing Essays in Honor of Professor Daniel J. Rosenkrantz
title_auth Fundamental Problems in Computing Essays in Honor of Professor Daniel J. Rosenkrantz
title_exact_search Fundamental Problems in Computing Essays in Honor of Professor Daniel J. Rosenkrantz
title_full Fundamental Problems in Computing Essays in Honor of Professor Daniel J. Rosenkrantz edited by Sekharipuram S. Ravi, Sandeep Kumar Shukla
title_fullStr Fundamental Problems in Computing Essays in Honor of Professor Daniel J. Rosenkrantz edited by Sekharipuram S. Ravi, Sandeep Kumar Shukla
title_full_unstemmed Fundamental Problems in Computing Essays in Honor of Professor Daniel J. Rosenkrantz edited by Sekharipuram S. Ravi, Sandeep Kumar Shukla
title_short Fundamental Problems in Computing
title_sort fundamental problems in computing essays in honor of professor daniel j rosenkrantz
title_sub Essays in Honor of Professor Daniel J. Rosenkrantz
topic Compilers and Interpreters
Computer System Implementation
Formal Languages and Automata Theory
Logic Design
Compilers (Computer programs)
Computer systems
Machine theory
Logic design
topic_facet Compilers and Interpreters
Computer System Implementation
Formal Languages and Automata Theory
Logic Design
Compilers (Computer programs)
Computer systems
Machine theory
Logic design
url https://doi.org/10.1007/978-1-4020-9688-4
work_keys_str_mv AT ravisekharipurams fundamentalproblemsincomputingessaysinhonorofprofessordanieljrosenkrantz
AT shuklasandeepkumar fundamentalproblemsincomputingessaysinhonorofprofessordanieljrosenkrantz