default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGeorge W. Hart
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[j14]George W. Hart:
An Algorithm for Constructing 3D Struts. J. Comput. Sci. Technol. 24(1): 56-64 (2009)- 2008
- [c12]George W. Hart:
Sculptural forms from hyperbolic tessellations. Shape Modeling International 2008: 155-161 - 2002
- [c11]Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke:
Vertex-unfoldings of simplicial manifolds. SCG 2002: 237-243 - 2001
- [c10]George W. Hart:
Rapid prototyping of geometric models. CCCG 2001: 1-4 - [c9]George W. Hart:
Computational geometry for sculpture. SCG 2001: 284-287 - [i2]Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke:
Vertex-Unfoldings of Simplicial Polyhedra. CoRR cs.CG/0107023 (2001) - [i1]Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke:
Vertex-Unfoldings of Simplicial Manifolds. CoRR cs.CG/0110054 (2001) - 2000
- [j13]George W. Hart:
Chaos and Graphics: Reticulated geodesic constructions. Comput. Graph. 24(6): 907-910 (2000)
1990 – 1999
- 1995
- [j12]Vassilis J. Tsotras
, B. Gopinath, George W. Hart:
Efficient Management of Time-Evolving Databases. IEEE Trans. Knowl. Data Eng. 7(4): 591-608 (1995) - [j11]Isabelle Rouvellou, George W. Hart:
Inference of a probabilistic finite state machine from its output. IEEE Trans. Syst. Man Cybern. 25(3): 424-437 (1995) - [c8]Isabelle Rouvellou, George W. Hart:
Automatic Alarm Correlation for Fault Identification. INFOCOM 1995: 553-561 - 1994
- [j10]George W. Hart:
To Decode Short Cryptograms. Commun. ACM 37(9): 102-108 (1994) - [j9]Jean-François P. Labourdette, George W. Hart, Anthony S. Acampora:
Branch-exchange sequences for reconfiguration of lightwave networks. IEEE Trans. Commun. 42(10): 2822-2832 (1994) - [j8]George W. Hart, Samir G. Kelekar:
Automated repair of complex systems by fault compensation. IEEE/ACM Trans. Netw. 2(2): 193-205 (1994) - 1993
- [j7]Anastasios T. Bouloutas, George W. Hart, Mischa Schwartz:
Fault identification using a finite state machine model with unreliable partially observed data sequences. IEEE Trans. Commun. 41(7): 1074-1083 (1993) - [j6]George W. Hart, Anastasios T. Bouloutas:
Correcting dependent errors in sequences generated by finite-state processes. IEEE Trans. Inf. Theory 39(4): 1249-1260 (1993) - [c7]Samir G. Kelekar, George W. Hart:
Synthesis of Protocols and Protocol Converters Using the Submodule Construcion Approach. PSTV 1993: 307-322 - 1992
- [j5]George W. Hart:
Nonintrusive appliance load monitoring. Proc. IEEE 80(12): 1870-1891 (1992) - [j4]Anastasios T. Bouloutas, George W. Hart, Mischa Schwartz:
Simple finite-state fault detectors for communication networks. IEEE Trans. Commun. 40(3): 477-479 (1992) - [j3]Jean-François P. Labourdette, George W. Hart:
Blocking probabilities in multitraffic loss systems: insensitivity, asymptotic behavior, and approximations. IEEE Trans. Commun. 40(8): 1355-1366 (1992) - [c6]Isabelle Rouvellou, George W. Hart:
Topology Identification for Traffic and Configuration Management in Dynamic Networks. INFOCOM 1992: 2197-2204 - [c5]Jean-François P. Labourdette, Anthony S. Acampora, George W. Hart:
Reconfiguration Algorithms for Rearrangeable Lightwave Networks. INFOCOM 1992: 2205-2214 - [c4]Isabelle Rouvellou, George W. Hart:
Topology Identification Algorithm For Network Management. NOMS 1992: 242-253 - 1991
- [j2]Anastasios T. Bouloutas, George W. Hart, Mischa Schwartz:
Two extensions of the Viterbi algorithm. IEEE Trans. Inf. Theory 37(2): 430-436 (1991) - [j1]Raghavan Kannurpatti, George W. Hart:
Memoryless nonlinear system identification with unknown model order. IEEE Trans. Inf. Theory 37(5): 1440-1450 (1991) - 1990
- [c3]Vassilis J. Tsotras, B. Gopinath, George W. Hart:
Optimally Managing the History of an Evolving Forest. SIGAL International Symposium on Algorithms 1990: 468-478 - [c2]Jean-François P. Labourdette, George W. Hart:
Link Access Blocking in Very Large Multi-Media Networks. SIGCOMM 1990: 108-117 - [c1]Vassilis J. Tsotras, B. Gopinath, George W. Hart:
Using universe knowledge and arithmetic to get faster parallel algorithms. SPDP 1990: 634-641
1980 – 1989
- 1987
- [b1]George W. Hart:
Minimum information estimation of structure. Massachusetts Institute of Technology, Cambridge, MA, USA, 1987
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
